In 1847, an English mathematician named George Boole started treating logic as a kind of algebra. Nearly two centuries later, every digital circuit in your phone still follows his rules.
An algebra where the numbers are true and false
School algebra works with numbers. You add them, you multiply them, you solve for x.
Boole’s version keeps the letters but swaps everything else. Its values are not numbers at all, just true and false, usually written as 1 and 0. And instead of addition and multiplication, it runs on three operations: AND, OR and NOT.
Boole laid the idea out in The Mathematical Analysis of Logic in 1847, then gave a fuller and more ambitious version in An Investigation of the Laws of Thought in 1854. In doing so, he helped found modern mathematical logic and a new branch of abstract algebra at the same time.
It looks like school algebra, but it plays by different rules
The notation can look familiar, which is exactly where the confusion starts. In ordinary algebra, 2 times 2 gives you 4. In Boolean algebra, combining a value with itself using AND just gives you the same value back. “True and true” is simply true.
The biggest trap is the belief that Boolean 0 and 1 behave like the everyday numbers 0 and 1. They do not. They can be treated as arithmetic modulo 2, the same “wrap around” logic as a clock, except this clock has only two positions. Count one step past 1 and you land back on 0. So in this system, 1 plus 1 equals 0, and nobody made a mistake.
The system also has a strange mirror built in. Swap every 0 for a 1, and every AND for an OR, and all of its laws still hold. Mathematicians call this the duality principle. The famous De Morgan’s laws follow the same spirit: saying “it is not true that A or B” means exactly the same thing as “not A, and not B”.
A master’s thesis connected Boole to electricity
For decades, Boole’s algebra lived mostly in mathematics. The name itself only came later: the term “Boolean algebra” was suggested by Henry M. Sheffer in 1913.
Meanwhile, a few electrical engineers of the early 20th century had a hunch. The switching circuits they built seemed to behave a lot like Boole’s logic. A switch is either open or closed, a bit like false or true.
It took a young American engineer to turn that hunch into a proof. In his 1937 master’s thesis, Claude Shannon showed formally that relay and switching circuits obey the laws of Boolean algebra exactly. That link between a 19th-century logic and physical hardware became a foundation of the entire digital age.
Why computers settled on only two voltages
Modern chips represent Boolean 0 and 1 with two voltage levels. That choice was not a law of nature.
In theory, designers could have used four voltage levels and stored four different symbols in the same wire. The problem was practical. Once engineers had to balance speed, size and power consumption, the extra levels made electrical noise far too troublesome to manage.
Two clean, well-separated states turned out to be the robust option. So the hardware ended up speaking the exact language Boole had written down, one true or false at a time. Today, that same logic is also built into every modern programming language.
The things Boole’s algebra still cannot say
For all its reach, Boolean algebra has limits. It cannot express statements that use quantifiers, words like “for every” or “there exists”, which are central to the richer first-order logic mathematicians rely on.
Yet its core turned out to be remarkably deep. In 1936, mathematician M. H. Stone proved that every Boolean algebra, however abstract, can be represented as a collection of sets. The same structure behind a pair of light switches sits comfortably at the heart of pure mathematics.
That may be the most surprising part of the story. A theory built to describe how we reason ended up describing how machines compute, and it only needed two values to do it.

