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.

Principle

Boolean algebra axiomatizes classical two-valued logic and set algebra: binary operations distribute over each other and every element has a unique complement relative to the bounds, enabling algebraic manipulation of truth and membership.

Demonstration

The power set of a universe with ∪, ∩, complement relative to the universe, empty set as 0 and universe as 1 is a Boolean algebra; propositional formulas modulo logical equivalence form a Boolean algebra under ∧, ∨, and ¬.

Misapplication

Applying Boolean reasoning in non-distributive lattices (e.g., modular lattices without complements) or treating complements as set-theoretic complements when the algebra is not Boolean; assuming countable-sigma properties (measure notions) from Boolean structure.

Consequence

Permits algebraic simplification of logical expressions and set operations, enables representation theorems (Stone-style), supports Boolean homomorphisms and quotient algebras, and underlies digital logic and classical propositional reasoning.

Reversal

A Heyting algebra (intuitionistic logic) weakens the complement requirement: negation is not involutive and x ∨ ¬x need not equal 1. Removing distributivity yields non-Boolean complemented lattices with different algebraic behaviour.

Boundary

Must be bounded, distributive, and complemented; excludes lattices that lack distributivity or complements, sigma-algebras (measure-theoretic closure under countable unions is a distinct notion), and structures where negation is only pseudo-complement.

Semantic Tension

Boolean algebra versus Boolean ring: both encode same algebraic data but with differing primitive operations; Boolean algebra versus σ-algebra: σ-algebra adds countable closure for measure theory, a different categorical emphasis.

Synthesis

A Boolean algebra is the algebraic structure capturing classical two-valued logic and set complementarity: a bounded distributive lattice where every element has a unique complement, enabling algebraic manipulation of truth and membership.