Triple

Given a phrase, classify it is english named entity (e.g., persons, organizations, works of art) in Latin script, or not (e.g., literals, dates, URLs, verbose phrases). For disambiguation, the statement where the phrase occurs as object is also given. Please return a JSON object with `phrase` (string, the phrase being analyzed) and `is_ne` (boolean, indicating whether the phrase is a Named Entity).

Phrase: Heyting algebra | Statement: [Arend Heyting, notableFor, Heyting algebra]

Target entity: Heyting algebra
Context triple: [Arend Heyting, notableFor, Heyting algebra]

• A. Brouwer–Heyting–Kolmogorov interpretation
  The Brouwer–Heyting–Kolmogorov interpretation is a foundational explanation of intuitionistic logic that interprets logical connectives and proofs in terms of explicit constructions and algorithms rather than classical truth values.
• B. Handbook of Boolean Algebras
  The *Handbook of Boolean Algebras* is a comprehensive multi-volume reference work that surveys the theory, structure, and applications of Boolean algebras in modern mathematics and logic.
• C. Lattice Theory
  Lattice Theory is a foundational mathematical text that systematically develops the theory of lattices and ordered structures, profoundly influencing modern algebra and order theory.
• D. Gödel–Löb provability logic (GL)
  Gödel–Löb provability logic (GL) is a modal logic system that formalizes reasoning about provability in arithmetic, capturing the behavior of the provability predicate in Peano Arithmetic.
• E. Hilbert-style deductive systems
  Hilbert-style deductive systems are axiomatic proof systems in mathematical logic that use a small set of axiom schemas and a few inference rules (typically including modus ponens) to derive theorems in formal theories such as Zermelo–Fraenkel set theory.
• F. None of above. chosen
• G. Unsure - the case is ambiguous/there is not enough information to decide.

Generate a one-sentence description of the target entity. 
You are given a context triple in the form (subject, predicate, object), where the object is the target entity. 
# Instructions
Use the triple to infer relevant information about the entity. Describe the entity based on what is most defining, well-known. 
Avoid repeating the information from the triple, unless really essential.
# Response Format
Return only the sentence: "Description: [one-sentence description of the target entity]"

Entity: Heyting algebra
Triple: [Arend Heyting, notableFor, Heyting algebra]

A Heyting algebra is a type of bounded lattice that models intuitionistic logic by providing an implication operation without requiring the law of excluded middle.

Target entity: Heyting algebra
Target entity description: A Heyting algebra is a type of bounded lattice that models intuitionistic logic by providing an implication operation without requiring the law of excluded middle.

• A. Brouwer–Heyting–Kolmogorov interpretation
  The Brouwer–Heyting–Kolmogorov interpretation is a foundational explanation of intuitionistic logic that interprets logical connectives and proofs in terms of explicit constructions and algorithms rather than classical truth values.
• B. Handbook of Boolean Algebras
  The *Handbook of Boolean Algebras* is a comprehensive multi-volume reference work that surveys the theory, structure, and applications of Boolean algebras in modern mathematics and logic.
• C. Lattice Theory
  Lattice Theory is a foundational mathematical text that systematically develops the theory of lattices and ordered structures, profoundly influencing modern algebra and order theory.
• D. Gödel–Löb provability logic (GL)
  Gödel–Löb provability logic (GL) is a modal logic system that formalizes reasoning about provability in arithmetic, capturing the behavior of the provability predicate in Peano Arithmetic.
• E. Hilbert-style deductive systems
  Hilbert-style deductive systems are axiomatic proof systems in mathematical logic that use a small set of axiom schemas and a few inference rules (typically including modus ponens) to derive theorems in formal theories such as Zermelo–Fraenkel set theory.
• F. None of above. chosen