Boolean algebra is the branch of mathematics that deals with variables having only two possible values — true or false, 1 or 0, on or off — and the operations that combine them. It was developed decades before the first digital computer, but it turned out to describe exactly what a switch-based circuit can do, which is why every digital circuit built since has depended on it.
Just two values, not infinitely many
Ordinary algebra works with numbers that can take any value — 3.7, -12, a million. Boolean algebra restricts every variable to exactly two possible states. That restriction is what makes it map so cleanly onto physical circuits: a wire is either carrying voltage or it isn't, a switch is either open or closed, a transistor is either conducting or not. There's no "halfway" state to represent, so a two-valued algebra is a natural, complete fit.
Three core operations
Everything in Boolean algebra is built from three operations: AND, OR, and NOT. AND requires every input to be true; OR requires at least one; NOT flips a single value. Every other gate — NAND, NOR, XOR, XNOR — can be built from combinations of these three, and every Boolean expression, however complex, reduces to some combination of them. Full truth tables for all seven common gates are in Logic Gates 101.
From George Boole to digital circuits
George Boole developed this algebra in the 1840s as a way to formalize logical reasoning — it had nothing to do with electronics at the time. Nearly a century later, Claude Shannon showed that Boolean algebra describes switching circuits exactly: true/false maps directly onto closed/open switches, and AND/OR/NOT map directly onto how switches can be wired in series or parallel. That connection is the entire reason Boolean algebra, not some other mathematical system, is what runs underneath every digital circuit today. More on the people behind this in A Brief History of Boolean Algebra.
How it's different from the algebra you already know
A few properties of Boolean algebra look strange the first time you see them, precisely because they have no equivalent in ordinary arithmetic:
- A + A = A, not 2A — there's no concept of "twice as true." Adding a value to itself changes nothing.
- A · A = A for the same reason — there's no squaring in a system with only two values to begin with.
- There's no subtraction or division — only AND, OR, and NOT (and whatever's built from them). Boolean algebra doesn't need inverse operations the way ordinary arithmetic does.
- A + A′ = 1 always, and A · A′ = 0 always — a variable and its complement together cover every possibility (the complement law), which has no direct equivalent in ordinary algebra either.
These aren't quirks to memorize in isolation — they're the formal foundation behind every simplification this site's solver performs. The full working set of laws — De Morgan's, absorption, consensus, distributive, and the rest — is collected in the Boolean Algebra Laws Cheat Sheet.
Why it matters practically
Every simplification technique on this site — K-map grouping, Quine-McCluskey, Petrick's method — is really just a systematic, visual, or algorithmic way of applying Boolean algebra's laws faster than doing it symbol-by-symbol. Understanding the algebra itself is what makes those techniques feel like more than memorized procedures — it's why a K-map grouping "obviously" works instead of being a trick that happens to give the right answer.
Next: see the algebra in action on real digital logic problems in the worked examples, or start simplifying directly with the K-map solver.