Every time you search the internet, send a message, or take a photograph with your phone, you are relying on a system of mathematics invented in 1854 by a self-taught English schoolteacher named George Boole. His book, An Investigation of the Laws of Thought, proposed something that seemed absurd at the time: that the rules of human logic could be written as algebraic equations. True and false could be represented as 1 and 0. Logical operations like “and,” “or,” and “not” could be expressed as mathematical functions.
Nobody in 1854 had any practical use for this idea. There were no computers, no electronic circuits, no digital technology of any kind. Boole was pursuing a purely intellectual question: can thought be reduced to calculation? The answer, as it turned out, was yes. And eighty years later, when engineers began building electronic computers, they discovered that Boole’s algebra was exactly the tool they needed.
Who Was George Boole?
George Boole (1815 to 1864) was born in Lincoln, England, the son of a cobbler. His family could not afford to send him to university. He educated himself, learning Latin, Greek, French, German, and eventually advanced mathematics from borrowed books. By the age of sixteen, he was working as a schoolteacher. By twenty, he was publishing original mathematical papers. By thirty-four, despite having no university degree, he was appointed Professor of Mathematics at Queen’s College, Cork, in Ireland.
Boole was influenced by two traditions. The first was the algebraic revolution of the early 19th century, which had shown that algebra need not be limited to numbers. The second was the logical tradition stretching back to Aristotle, who had formalized the rules of syllogistic reasoning two thousand years earlier. Boole’s genius was to see that these two traditions could be merged: logic could become a branch of algebra.
The Laws of Thought
Boole’s system is built on a remarkably simple foundation. There are only two values: 1 (true) and 0 (false). And there are only three basic operations:
AND (written as multiplication): A AND B is true only when both A and B are true. In Boole’s notation: A × B = 1 only if A = 1 and B = 1.
OR (written as addition): A OR B is true when at least one of A or B is true. In Boole’s notation: A + B = 1 if A = 1, B = 1, or both.
NOT (written as complement): NOT A is true when A is false, and false when A is true. If A = 1, then NOT A = 0.
From these three operations, Boole showed that you can express any logical statement, no matter how complex. The rules of syllogistic logic that Aristotle had catalogued can all be written as Boolean equations. So can the rules of set theory, probability theory, and eventually circuit design.
An Example
Consider the logical statement: “If it is raining AND I have an umbrella, THEN I will stay dry.” In Boolean algebra, let R = “it is raining,” U = “I have an umbrella,” and D = “I stay dry.” The statement becomes: D = R × U. If both R and U are 1 (true), then D is 1 (true). If either R or U is 0, then D is 0.
This may seem like a trivial way to express a simple idea. But the power of Boole’s system lies in its ability to handle vastly more complex logical structures with the same simple rules. A modern microprocessor contains billions of logical operations, all expressible in Boolean algebra, all reducible to combinations of AND, OR, and NOT.
From Logic to Circuits: Claude Shannon’s Breakthrough
For eighty years after Boole’s death, Boolean algebra remained a purely theoretical subject, studied by logicians and philosophers but ignored by engineers. That changed in 1937, when a twenty-one-year-old MIT graduate student named Claude Shannon wrote what has been called the most important master’s thesis of the 20th century.
Shannon’s thesis, “A Symbolic Analysis of Relay and Switching Circuits,” demonstrated that Boolean algebra could be used to design and analyze electrical circuits. An electrical switch has two states: open (0) and closed (1). Switches connected in series perform the AND operation (both must be closed for current to flow). Switches connected in parallel perform the OR operation (current flows if either is closed). A relay can perform the NOT operation (inverting the signal).
This insight was the bridge between abstract logic and physical engineering. Shannon showed that any Boolean function could be implemented as an electrical circuit, and that any electrical circuit could be analyzed using Boolean algebra. This meant that the entire apparatus of logical reasoning could be built in hardware.
Logic Gates: The Building Blocks of Computing
Modern computers are built from logic gates: tiny electronic components that implement Boolean operations. The basic gates are:
- AND gate: outputs 1 only if both inputs are 1
- OR gate: outputs 1 if at least one input is 1
- NOT gate (inverter): outputs the opposite of its input
- NAND gate (NOT AND): outputs 0 only if both inputs are 1
- NOR gate (NOT OR): outputs 0 if at least one input is 1
- XOR gate (exclusive OR): outputs 1 if exactly one input is 1
The NAND gate is particularly important because it is “functionally complete”: any Boolean function can be built using only NAND gates. In practice, this means that an entire computer can be constructed from a single type of component. Modern processors exploit this principle, using billions of transistors configured as logic gates to perform every operation from simple arithmetic to complex artificial intelligence.
A modern smartphone processor contains approximately 15 billion transistors. Each one is, at its core, a switch that implements a Boolean operation. The entire edifice of modern computing, from spreadsheets to streaming video to large language models, rests on the two values and three operations that George Boole described in 1854.
Boolean Algebra in Everyday Life
You use Boolean algebra every day, even if you do not realize it.
Search engines use Boolean operators to filter results. When you search for “Newton AND calculus,” you are performing a Boolean AND operation, requesting only pages that contain both terms. When you search for “Newton OR Leibniz,” you are performing a Boolean OR. When you add a minus sign (“Newton calculus NOT Leibniz”), you are performing a Boolean NOT.
Databases use Boolean logic to query records. Every SQL query (“SELECT * FROM books WHERE author = ‘Newton’ AND year > 1686”) is a Boolean expression applied to a dataset.
Digital circuits in everything from washing machines to spacecraft use Boolean logic to make decisions. A thermostat that turns on the heater when the temperature is below 20°C AND the system is in heating mode is implementing a Boolean AND function in hardware.
From Boole to the Digital Age
The chain of ideas from Boole to the modern computer passes through several key figures. Shannon showed how to implement Boolean logic in circuits. Alan Turing showed that a sufficiently powerful logical machine could compute anything computable. John von Neumann designed the stored-program architecture that organized these logical circuits into a practical computer.
Kronecker Wallis’s edition of the EDVAC Report reproduces the 1945 document in which von Neumann described the architecture that turned Boolean logic gates into a general-purpose computing machine. Printed on blue Fabriano paper in monospace type and held together with metal screw fasteners, this handmade edition presents the blueprint for every digital device that has ever implemented Boole’s algebra in silicon.
For those interested in the cryptographic applications of Boolean logic, Kronecker Wallis’s edition of Alan Turing’s Treatise on the Enigma shows how Turing applied logical reasoning to the practical problem of breaking the Enigma cipher. The Bombe machine that Turing designed was, at its core, a physical implementation of Boolean logic applied to the search for valid decryption keys.
And for those who want to trace the mathematical tradition of rigorous logical reasoning from its origins, Euclid’s Elements represents the beginning: the first systematic attempt to build complex knowledge from simple axioms through pure deduction. Boole’s algebra of logic is, in a sense, the algebraic fulfillment of the project that Euclid began with geometry over two thousand years ago.
The Schoolteacher Who Built the Digital World
George Boole died in 1864, at the age of forty-nine, from pneumonia contracted after walking to class in the rain. He never saw an electric light, let alone a computer. He could not have imagined that the abstract logical system he devised as a philosophical exercise would become the foundation of a technology that reshaped civilization.
But that is precisely what happened. Every computer, every smartphone, every digital camera, every internet router, every artificial intelligence system operates on the principles that Boole laid down in The Laws of Thought. The entire digital world is built on two values (1 and 0) and three operations (AND, OR, NOT). It is one of the most extraordinary cases in the history of ideas: a purely abstract theory, created with no practical application in mind, that turned out to be the key to the most transformative technology in human history.
No products in the cart. 