Boolean algebra
Algebra of truth values and logical operations.
Boolean algebra is a branch of algebra that deals with truth values rather than numerical quantities. In this system, variables can only take one of two values: true or false, which are conventionally represented by 1 and 0, respectively. This contrasts with elementary algebra, where variables represent numbers. The operations of Boolean algebra are logical: conjunction (and, often denoted ∧), disjunction (or, denoted ∨), and negation (not, denoted ¬), instead of the arithmetic operations of addition, multiplication, subtraction, and division. Boolean algebra thus provides a formal framework for expressing logical operations, much as elementary algebra formalizes numerical ones.
The system was first introduced by George Boole in his 1847 work *The Mathematical Analysis of Logic* and expanded in his 1854 book *An Investigation of the Laws of Thought*. The term "Boolean algebra" itself was suggested by Henry M. Sheffer in 1913, though Charles Sanders Peirce had used the phrase "A Boolian Algebra with One Constant" as early as 1880. A precursor to Boole's work can be found in Gottfried Wilhelm Leibniz's algebra of concepts, which is deductively equivalent to the Boolean algebra of sets. Boole's algebra predates modern abstract algebra and mathematical logic, but it is connected to the origins of both fields. It was later refined in the late 19th century by figures such as Jevons, Schröder, and Huntington, leading to the modern abstract mathematical structure. In 1936, M. H. Stone proved that every Boolean algebra is isomorphic to a field of sets.
In the 1930s, Claude Shannon applied Boole's rules to switching circuits, introducing switching algebra as a two-element Boolean algebra for circuit design. This work became fundamental to digital electronics, and Boolean algebra is now embedded in all modern programming languages. It also finds use in set theory and statistics. The Boolean satisfiability problem (SAT), which asks whether a formula's variables can be assigned to make it true, is a central problem in theoretical computer science and was the first problem shown to be NP-complete. Boolean algebra is equivalent to classical propositional calculus but cannot capture quantifier-based logic like first-order logic.
- field
- Mathematics and mathematical logic
- introduced_by
- George Boole
Lore & Background
A precursor of Boolean algebra was Gottfried Wilhelm Leibniz's algebra of concepts, which is deductively equivalent to the Boolean algebra of sets. Boole's algebra predated modern developments in abstract algebra and mathematical logic but is seen as connected to the origins of both fields. In the late 19th century, it was perfected by Jevons, Schröder, Huntington, and others, reaching the modern conception of an abstract mathematical structure. M. H. Stone proved in 1936 that every Boolean algebra is isomorphic to a field of sets. Boolean algebra differs from elementary algebra in that its variables take only the truth values true and false, usually denoted 1 and 0, rather than numbers. Its operations are logical: conjunction (and), disjunction (or), and negation (not), as opposed to arithmetic operations. It is a formal way to describe logical operations analogous to how elementary algebra describes numerical ones. Boolean algebra has been fundamental to digital electronics and is provided for in all modern programming languages, also used in set theory and statistics. In the 1930s, Claude Shannon applied Boole's rules to switching circuits, introducing switching algebra as the two-element Boolean algebra for analyzing and designing circuits with logic gates. The Boolean satisfiability problem, determining if a formula’s variables can be assigned to make it true, is NP-complete and important to theoretical computer science. Boolean algebra also deals with functions valued in {0,1}, such as sequences of bits or indicator functions of subsets.
Reader's Guide
Boolean algebra has been fundamental in the development of digital electronics and is provided for in all modern programming languages. It is also used in set theory and statistics. In the 1930s, Claude Shannon applied Boole's algebra to switching circuits, introducing switching algebra as a way to analyze and design circuits using logic gates, casting it as the two-element Boolean algebra. Efficient implementation of Boolean functions is a fundamental problem in combinational logic circuit design; modern electronic design automation tools for VLSI circuits often rely on binary decision diagrams (BDD) for logic synthesis and formal verification. Logic sentences expressible in classical propositional calculus have an equivalent expression in Boolean algebra, though it cannot capture formulas with quantifiers. The Boolean satisfiability problem (SAT) is the first problem shown to be NP-complete and is important to theoretical computer science.
Did You Know?
- Claude Shannon introduced switching algebra as the two-element Boolean algebra in the 1930s.
More in Mathematical Logic And Computation 1-21
Spotted an error? Know more?
This is a living reference — every entry is fact-audited, and reader corrections feed straight into our audit queue. Suggest an edit · See this site's audit record