Boolean Algebra

A complemented distributive lattice with binary meet (∧) and join (∨), unary complement (¬), and distinguished least (0) and greatest (1) elements, satisfying distributivity, complement laws (x ∨ ¬x = 1, x ∧ ¬x = 0), and De Morgan identities.

A complemented distributive lattice with a greatest and least element, providing algebraic operations corresponding to logical conjunction, disjunction, and negation.

A distributive bounded lattice (with top 1 and bottom 0) in which every element a has a complement a' satisfying a ∧ a' = 0 and a ∨ a' = 1; an algebraic structure modelling classical propositional logic and set operations.