−Table of Contents
Hilbert algebras
Abbreviation: HilA
Definition
A \emph{Hilbert algebra} is a structure A=⟨A,→,1⟩ of type ⟨2,1⟩ such that
x→(y→x)=1
(x→(y→z))→((x→y)→(x→z))=1
x→y=1 and y→x=1⟹x=y
Morphisms
Let A and B be Hilbert algebras. A morphism from A to B is a function h:A→B that is a homomorphism: h(x→y)=h(x)→h(y) and h(1)=1.
Definition
A \emph{Hilbert algebra} is a structure A=⟨A,→,1⟩ of type ⟨2,1⟩ such that
x→x=1
1→x=x
x→(y→z)=(x→y)→(x→z)
(x→y)→((y→x)→x)=(y→x)→((x→y)→y)
Examples
Example 1: Given any poset with top element 1, ⟨A,≤,1⟩, define a→b={1 if a≤bb otherwise. Then ⟨A,→,1⟩ is a Hilbert algebra.
Basic results
Hilbert algebras are the algebraic models of the implicational fragment of intuitionistic logic, i.e., they are (→,1)-subreducts of Heyting algebras.
The variety of Hilbert algebras is not generated as a quasivariety by any of its finite members 1).
Properties
Finite members
$\begin{array}{lr}
f(1)= &1\\ f(2)= &\\ f(3)= &\\ f(4)= &\\ f(5)= &\\
\end{array}\begin{array}{lr}
f(6)= &\\ f(7)= &\\ f(8)= &\\ f(9)= &\\ f(10)= &\\
\end{array}$