Linked from

The 80 pages that link to Boolean algebra, each with the reason it gives.

• NOR gateNarrower topic: NOR is the negated OR operation within this algebra.

• Order theoryBroader topic: Boolean algebras use lattice order to organize logical operations.

• Boolean prime ideal theoremNarrower topic: The theorem applies to every nontrivial structure of this kind.

• Konrad ZuseRelated: Its logic operations provide a mathematical basis for the switching circuits in Zuse’s computers.

• Discrete mathematicsRelated: Boolean expressions describe digital circuits and the logic of computation.

• Peirce's lawRelated: Boolean algebra validates Peirce's law through its classical implication operation.

• Synchronous circuitNarrower topic: Boolean functions specify the combinational logic between clocked state elements.

• ColossusRelated: Colossus circuits evaluated logical relations among cipher characters.

• Elementary algebraCompared with: Its symbols and operations follow rules unlike ordinary numerical algebra.

• Principle of bivalenceRelated: Its two-element form models bivalent truth and underlies digital switching.

• Venn diagramNarrower topic: Its operations correspond to intersection, union, and complement in set diagrams.

• XNOR gateNarrower topic: XNOR behavior can be expressed and simplified with Boolean identities.

• Absorption lawBroader topic: Its meet and join correspond to conjunction and disjunction, where absorption simplifies formulas.

• Consensus theoremNarrower topic: The theorem is an identity within this algebra, using its operations and complement notation.

• Cox's theoremRelated: Cox's functional constraints apply to the logical operations on propositions.

• De Morgan's lawsBroader topic: Boolean algebras satisfy De Morgan's identities for every pair of elements.

• Dynkin systemNarrower topic: Set algebras provide a broader algebraic perspective on complement and union operations.

• Lindenbaum's lemmaRelated: The algebra of formulas reveals an equivalent extension principle through ultrafilters.

• Zero-dimensional spaceRelated: The clopen subsets of a space form a Boolean algebra.

• Binary multiplierNarrower topic: Gate-level multiplier designs implement arithmetic through Boolean functions.

• Boole's expansion theoremNarrower topic: Boole's theorem arose from this broader algebraic system.

• History of computer scienceRelated: It later provided a mathematical basis for representing logic in digital circuits.

• If and only ifNarrower topic: Its identities express biconditionals as equivalences between Boolean expressions.

• Join and meetRelated: Logical conjunction and disjunction behave as meet and join in its order.

• Kuratowski's closure-complement problemRelated: Complementation obeys Boolean laws, but closure adds topological constraints absent from a Boolean algebra.

• Logic (digital electronics)Related: Its equations describe how digital circuits combine and invert binary values.

• Modus ponendo tollensRelated: Boolean algebra provides a precise setting for checking this inference computationally.

• Rasiowa–Sikorski lemmaRelated: The lemma is closely connected to constructing filters in Boolean algebras.

• Stone's representation theorem for Boolean algebrasNarrower topic: Stone's result addresses the representation of this algebraic structure.

• Ugly duckling theoremRelated: The proof treats property descriptions as combinations of predicates and their negations.