Linked from

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

• SetRelated: Set union, intersection, and complement obey Boolean algebra's characteristic laws.

• Gottfried Wilhelm LeibnizRelated: Leibniz's project of symbolic reasoning anticipated the mathematical treatment of logic.

• Propositional logicRelated: Its operations provide an algebraic account of propositional connectives and equivalences.

• Power setRelated: A power set forms a Boolean algebra under union, intersection, and complement.

• Classical logicRelated: It gives classical propositional logic an algebraic representation.

• SubsetRelated: Subsets of a fixed set form a Boolean algebra under intersection, union, and complement.

• NegationRelated: Its complement operation gives an algebraic account of negation.

• Binary numeral systemRelated: Its two-valued logic maps naturally to binary states in computing.

• BitRelated: Its operations provide the logic for combining and transforming binary values.

• Computer scienceRelated: Its logic underlies digital circuits, program conditions, and formal reasoning.

• Logical connectiveRelated: Its operations provide an algebraic treatment of truth-functional connectives.

• Truth valueRelated: Its two-element form represents false and true as algebraic values.

• Fuzzy logicRelated: Fuzzy logic generalizes familiar Boolean operations to graded values.

• Distributive propertyRelated: Its two distributive laws show that distribution is not limited to ordinary arithmetic.

• Binary operationRelated: Logical conjunction and disjunction are binary operations on truth values.

• William Stanley JevonsRelated: Jevons helped popularize and extend Boolean methods in nineteenth-century formal logic.

• Bibliographic databaseRelated: Boolean operators combine or exclude terms in many database search interfaces.

• CMOSRelated: CMOS transistor networks implement Boolean functions as logic gates.

• Digital circuitRelated: Boolean expressions describe the logic that gate networks implement.

• Forcing (mathematics)Related: Complete Boolean algebras provide an alternative presentation of forcing notions and truth values.

• Digital computerRelated: Logic circuits implement Boolean operations on binary signals.

• Augustus De MorganRelated: Its identities give an algebraic form to De Morgan’s laws.

• Digital electronicsRelated: It provides the rules used to describe and simplify digital logic.

• History of logicRelated: It helped turn reasoning into symbolic calculation.

• 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.

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

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

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

• 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.

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

• 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.

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