Abbreviation: HA
A \emph{Heyting algebra} is a structure A=⟨A,∨,0,∧,1,→⟩ such that
⟨A,∨,0,∧,1⟩ is a bounded distributive lattice
→ gives the residual of ∧: x∧y≤z⟺y≤x→z
A \emph{Heyting algebra} is a FLew-algebra A=⟨A,∨,0,∧,1,⋅,→⟩ such that
x∧y=x⋅y
Let A and B be Heyting algebras. A morphism from A to B is a function h:A→B that is a homomorphism:
h(x∨y)=h(x)∨h(y), h(0)=0, h(x∧y)=h(x)∧h(y), h(1)=1, h(x→y)=h(x)→h(y)
Example 1: The open sets of any topological space X form a Heyting algebra under the operations of union ∪, empty set ∅, intersection ∩, whole space X, and the operation U→V= interior of (X−U)∪V.
Example 2: Any frame can be expanded to a unique Heyting algebra by defining x→y=⋁{z:x∧z≤y}.
Any finite distributive lattice is the reduct of a unique Heyting algebra. More generally the same result holds for any complete and completely distributive lattice.
A Heyting algebra is subdirectly irreducible if and only if it has a unique coatom.
Classtype | variety |
---|---|
Equational theory | decidable |
Quasiequational theory | decidable |
First-order theory | undecidable |
Locally finite | no |
Residual size | unbounded |
Congruence distributive | yes |
Congruence modular | yes |
Congruence n-permutable | yes, n=2 |
Congruence e-regular | yes, e=1 |
Congruence uniform | no |
Congruence extension property | yes |
Definable principal congruences | yes |
Equationally def. pr. cong. | yes |
Amalgamation property | yes |
Strong amalgamation property | yes |
Epimorphisms are surjective | yes |
f(1)=1f(2)=1f(3)=1f(4)=2f(5)=3f(6)=5f(7)=8f(8)=15f(9)=26f(10)=47f(11)=82f(12)=151f(13)=269f(14)=494f(15)=891f(16)=1639f(17)=2978f(18)=5483f(19)=10006f(20)=18428
Values known up to size 49 1)