Heyting algebra
E1343171
UNEXPLORED
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.
All labels observed (1)
| Label | Occurrences |
|---|---|
| Heyting algebra canonical | 2 |
How this entity was disambiguated
This entity first appeared as the object of triple T18793326 — resolving that mention is where its identity was fixed. The disambiguator weighed these candidate entities and picked the highlighted one (or “None”, minting a new entity). This is how homonymy is resolved: the same surface form can point to different entities.
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
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.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
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
Referenced by (2)
Full triples — surface form annotated when it differs from this entity's canonical label.