−Table of Contents
Boolean semilattices
Abbreviation: BSlat
Definition
A \emph{Boolean semilattice} is a structure A=⟨A,∨,0,∧,1,¬,⋅⟩ such that
A is in the variety generated by complex algebras of semilattices
Let S=⟨S,⋅⟩ be a semilattice. The \emph{complex algebra} of S is Cm(S)=⟨P(S),∪,∅,∩,S,−,⋅⟩, where ⟨P(S),∪,∅,∩,S,−⟩ is the Boolean algebra of subsets of S, and
X⋅Y={x⋅y∣x∈X, y∈Y}.
Morphisms
Let A and B be Boolean semilattices. A morphism from A to B is a function h:A→B that is a Boolean homomorphism and preserves ⋅:
h(x⋅y)=h(x)⋅h(y)
Examples
Example 1:
Basic results
Properties
Finite members
f(1)=1f(2)=1f(3)=0f(4)=5f(5)=0f(6)=0f(7)=0f(8)=≥97 out of 104
Subclasses
Superclasses
References
1)\end{document} %</pre>