Processing math: 100%

Table of Contents

Heyting algebras

Abbreviation: HA

Definition

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 : xyzyxz

Definition

A \emph{Heyting algebra} is a FLew-algebra A=A,,0,,1,, such that

xy=xy

Morphisms

Let A and B be Heyting algebras. A morphism from A to B is a function h:AB that is a homomorphism:

h(xy)=h(x)h(y), h(0)=0, h(xy)=h(x)h(y), h(1)=1, h(xy)=h(x)h(y)

Examples

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 UV= interior of (XU)V.

Example 2: Any frame can be expanded to a unique Heyting algebra by defining xy={z:xzy}.

Basic results

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.

Properties

Finite members

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)

Subclasses

Goedel algebras

Superclasses

Bounded distributive lattices

References


1) Marcel Ern\'e;, Jobst Heitzig and J\“urgen Reinhold,\emph{On the number of distributive lattices}, Electron. J. Combin., \textbf{9}2002,Research Paper 24, 23 pp. (electronic)MRreview