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

Principle

Distributivity together with the existence of complements for each element forces classical two-valued logical behavior and unique algebraic identities (de Morgan laws, absorption, etc.).

Demonstration

The power set of a set, with union, intersection and set-theoretic complement (and the whole set and empty set as top and bottom), is a canonical Boolean algebra; Boolean algebras also arise as algebras of propositional formulas modulo logical equivalence.

Misapplication

Treating any complemented lattice as Boolean without checking distributivity (there exist complemented lattices that are not distributive and hence not Boolean).

Consequence

Boolean algebras model classical propositional logic, admit algebraic manipulation (homomorphisms, ideals/filters), and have representation theorems linking them to certain topological spaces of ultrafilters, enabling dual perspectives.

Reversal

A Heyting algebra weakens Boolean algebra by dropping the law of excluded middle (no requirement that every element has a Boolean complement), providing the algebraic setting for intuitionistic logic.

Boundary

Boolean algebra is a specific class of lattices: it requires distributivity, complements, and bounds. Structures that lack any of these (modular lattices, general distributive lattices without complements) are excluded.

Semantic Tension

Tension between Boolean algebra and algebraic variants (Boolean ring, distributive lattice, Heyting algebra): closely related algebraic presentations emphasize different operations and suggest different generalizations.

Synthesis

A Boolean algebra is the algebraic embodiment of classical two-valued logic: a distributive lattice with complements and bounds whose operations correspond to logical connectives and that supports both algebraic and topological representations.