# George Boole: The Shoemaker's Son Who Invented Boolean Algebra

*Science & Technology · Priya Nair · 2026-10-05*

## TL;DR

George Boole, an English mathematician, invented Boolean algebra, a system for reducing logic to two values, true and false, written as 1 and 0. His work from the 1840s and 1850s later became the foundation of digital computing.

## Key facts

- George Boole was the son of a shoemaker and was largely self-taught in mathematics after his primary education ended.
- He published his major work on logic in 1854, setting out what became known as Boolean algebra.
- Boolean algebra reduces logical statements to two values, true and false, represented as 1 and 0, and combines them with operations such as AND, OR, and NOT.
- In 1938, the American engineer Claude Shannon showed in his master's thesis that Boolean algebra could describe the switching of electrical relay circuits.
- Boole died decades before his logic became the basis for modern computers, phones, and search engines.

## The Shoemaker's Son Who Rewrote Logic

George Boole was the highly intelligent son of a poor shoemaker, and the algebra he built in the 1800s became the foundation for the computers and mobile phones in your pocket today. His father was a shoemaker of modest means. Money was tight in that household, and it shaped everything about how the boy learned.

Boole's formal schooling ended after primary level. There was no money for more. So he taught himself, and he did it the hard way: languages, mathematics, the whole stack of it, working alone with whatever books he could find. Picture a teenage boy in a cramped English town, borrowing texts, filling notebooks, chasing ideas nobody had assigned him. That was the education that built one of the sharpest mathematical minds of the nineteenth century.

The self-teaching paid off in a way that still raises eyebrows. In 1844, Boole received the Royal Society's Royal Medal for his paper "On a General Method in Analysis." Read that again: a man with only basic primary education, awarded one of science's top honors by the Royal Society itself.

And the payoff did not stop with the medal. Boole's algebra, the system of logic he developed, turned out to be exactly the language machines needed. Every digital circuit, every processor, every phone that lights up when you tap it runs on the logic he formalized. He never saw a computer. He never could have imagined one. But he wrote the rules they follow.

## Why Computers Only Speak in 1s and 0s

Your computer has never read a single word you have typed. It cannot see the letter A, it cannot picture the number 7, and it has no idea what a sentence even is. Every photo, song, message, and video game on your screen is stored as one long stream of 1s and 0s. That is the whole trick.

The reason comes down to arithmetic. In the decimal system we grow up with, a multiplication table has a hundred entries to memorize. Binary gets by with four. For a machine built from switches that are either on or off, that smaller, cleaner table is exactly what you want.

Think about a simple lamp wired to a switch. Flip the switch and current flows, the circuit closes, the bulb glows. In that world, 1 means current is flowing and 0 means it is not. In logic terms, the same two digits stand for true and false. So a computer never needs to understand meaning. It only needs to tell the difference between on and off, and it can do that billions of times a second.

Programs are just human-made sets of instructions, and those instruction sequences get encoded in the same binary scheme. Everything the machine processes arrives as a string of 1s and 0s, which is why any data we want it to handle has to be converted into that form first.

| Two switches, one lamp | Switch 1 | Switch 2 | Lamp (AND) | Lamp (OR) |
|---|---|---|---|---|
| 1 | 1 | 1 | 1 | Both closed |
| 1 | 0 | 0 | 1 | First closed |
| 0 | 1 | 0 | 1 | Second closed |
| 0 | 0 | 0 | 0 | Neither closed |

Wire two gates in series and the lamp lights only when both are closed, which is the AND pattern. Wire them in parallel and one closed gate is enough, which is OR. Four possible input combinations, two simple outcomes, and the entire logic of a machine starts to fall out of it.

This is where George Boole walks in. In 1854 he published his thoughts on a logical algebra built from just three operations: AND, OR and NOT. He replaced addition and multiplication with the connectives of logic, and that swap let complicated statements be simplified the way ordinary algebra simplifies equations. Truth and falsehood collapsed into two values, 1 for true and 0 for false. There is no subtraction in this system and no division either, which is precisely what makes it so tidy for a circuit.

One caution, though. Boole's 1 and 0 are not the same thing as binary numbers. His algebra follows rules that other forms of algebra simply do not allow. The resemblance is the useful part, not an identity.

If you want to picture the whole thing, draw circles. The British logician John Venn invented the overlapping diagrams we now call Venn diagrams around 1880, and they show exactly how sets relate under AND and OR.

## What Is Boolean Algebra? The Light Switch That Changed Everything

Picture a single bulb wired to a switch. Close the switch and the circuit completes; the bulb glows. That tiny act of closing a gate is the whole intuition behind Boolean algebra, the system George Boole built on just two values: 1 and 0.

Now add a second switch, and the wiring starts to get interesting. In one arrangement, the bulb lights only when *both* gates are closed. In another, it lights when *at least one* gate is closed. Boole assigned 1 to a closed gate and 0 to an open one, which gives four possible input combinations: 1-1, 1-0, 0-1, and 0-0.

| Circuit | Gate 1 | Gate 2 | Light |
|---|---|---|---|
| First (AND) | 1 | 1 | 1 |
| First (AND) | 1 | 0 | 0 |
| First (AND) | 0 | 1 | 0 |
| First (AND) | 0 | 0 | 0 |
| Second (OR) | 1 | 1 | 1 |
| Second (OR) | 1 | 0 | 1 |
| Second (OR) | 0 | 1 | 1 |
| Second (OR) | 0 | 0 | 0 |

Those two tables are exactly the truth patterns you would draw for the words AND and OR. Boolean algebra rests on three basic operations: AND, OR, and NOT, written as ∧, ∨, and ¬.

Boole wanted a way to frame logical arguments so they could be handled mathematically. So he built a kind of linguistic algebra, swapping addition and multiplication for the connectives of logic. His symbols let tangled logical expressions be simplified the way an ordinary equation can be tidied up.

He studied how numbers behave and noticed something remarkable. The set {0, 1} could form a consistent algebraic language with operations like addition and multiplication. In 1854 he published these thoughts, and in his logical algebra truth and falsehood were reduced to binary values: 1 for true, 0 for false.

This algebra breaks the rules you grew up with. There is no subtraction and no division. OR behaves like addition, except that 1 + 1 = 1. AND behaves like multiplication.

Want to see the relationships instead of reading them? Venn diagrams, invented by the British logician John Venn around 1880, draw Boolean relationships as overlapping circles.

## The Truth Table: A 19th-Century Tool That Still Runs Your Searches

The easiest way to see Boolean algebra at work is to build a truth table: a grid that tries every possible input combination and records the result. Flip two switches, and you get four possible states. Write them all down, one row at a time, and the logic of the circuit is laid bare in front of you.

Start with a single lamp on a circuit with one switch. Close the switch and the light comes on. Add a second switch and the puzzle sharpens. Wire the two gates so the bulb glows only when both are closed, and you have built an AND. Wire it so the bulb glows when at least one gate is closed, and you have an OR. Label a closed gate 1 and an open gate 0, and those four combinations fall into a tidy table. The first table matches the AND we learned in logic class; the second matches OR. In Boolean algebra the symbols get formal: ∧ for AND, ∨ for OR, ¬ for NOT.

Reading a finished table tells you whether a statement holds. Drawing one lets you test expressions far more tangled than two switches, stacking condition on condition until the answer is the only cell left standing. That is the quiet power of the grid. It does not argue. It exhausts.

Who drew the first one? Here the record gets murky. Truth tables are often credited to the American logician Charles Sanders Peirce in 1893, roughly 30 years after Boole's death, though the claim that Peirce was truly first is disputed, since truth-table-like methods appear in earlier work. What is not in doubt is the tool itself: a plain rectangle of 1s and 0s that turns a knot of logic into something you can check with your eyes.

### Reading the two gates

| Gate 1 | Gate 2 | AND (light) | OR (light) |
|---|---|---|---|
| 1 | 1 | 1 | 1 |
| 1 | 0 | 0 | 1 |
| 0 | 1 | 0 | 1 |
| 0 | 0 | 0 | 0 |

Notice what the table quietly assumes. In Boolean algebra, OR behaves like addition, except that 1 + 1 = 1, and AND behaves like multiplication. Truth and falsehood collapse into two values: 1 for true, 0 for false. There is no subtraction here, and no division. The rules allow statements that ordinary algebra would reject, which is exactly why the system fits logic so well. And if you would rather see the same relationships as overlapping circles, that is the Venn diagram, invented by the British logician John Venn.

## The 21-Year-Old Who Turned Boole's Logic into Circuits

Roughly seventy years after George Boole died, a 21-year-old American engineer named Claude Shannon sat down at MIT and wrote a master's thesis that explained how Boolean algebra could simplify electrical systems. The thesis carried the title "A Symbolic Analysis of Relay and Switching Circuits," and it was published in 1938. In that one document, the abstract logic of a Victorian mathematician became the blueprint for every digital machine that followed.

Think about what Shannon actually did. He looked at relay circuits, those clacking electromagnetic switches that routed telephone calls, and he noticed something nobody had bothered to formalize. A relay is either open or closed. A Boolean statement is either true or false. The two systems were speaking the same language, and Shannon was the first to write down the dictionary.

Boole had published his own thoughts on this logic in 1854, reducing truth and falsehood to the binary values 1 for true and 0 for false. For decades, that work sat mostly inside mathematics. Boolean algebra is now essential to probability theory, set theory, and computing, and it forms the foundation for designing electronic digital computer circuits. Logic gates, the tiny switches inside every processor, work entirely on the ideas of Boolean algebra. Every AND gate, every OR gate, every NOT gate is a physical echo of a symbol Boole drew on paper.

The publication of Shannon's thesis announced early the direction humanity would take in the twentieth century. A graduate student had connected a dead mathematician's abstract logic to electrical relays, and in doing so, he launched the computer age.

## How Boolean Logic Still Runs Your Search Engine

Open a search box and type two words. You probably never think about what happens between them, but something is there. Every time you hit enter, an invisible AND slides in between your terms. Search "George Boole" and the engine quietly reads it as *George* AND *Boole*. Only pages carrying both names reach your screen.

That hidden operator is not a modern invention. It is the same logic Boole set down in 1854, and it is still the machinery underneath the friendly face of search.

Boolean logic sits at the center of how internet search engines work. In the early days of the internet, this was not hidden at all. People typed AND, OR, and NOT right into the query bar to filter results, narrowing a search by hand until the right page surfaced. The commands were part of everyday searching.

Then the interface got polite. Modern technology lets you search in natural language, asking full questions the way you would ask a friend. The polish is real. The system behind it is not new. The same Boolean skeleton still runs underneath, doing the quiet work while the front end smiles at you.

So the next time a search returns exactly what you meant, remember the shoemaker's son. George Boole built the grammar your search bar speaks, and he built it more than a century before anyone had a screen to type into.


## Frequently asked questions

**Who was George Boole and why is he important?**

George Boole was the gifted son of a poor shoemaker, and he grew up to invent Boolean algebra, the logical system that underpins modern computers and mobile phones. In 1844 the Royal Society awarded him its Royal Medal for his paper on a general method of analysis.

**Was George Boole self-taught?**

Largely yes. Family finances limited him to a basic primary education, so after that he learned almost everything on his own. That self-directed study carried him from a modest household to a Royal Society medal in 1844.

**How did George Boole develop Boolean algebra?**

Boole wanted a way to frame logical arguments so they could be handled mathematically. He built a kind of linguistic algebra, swapping operations like addition and multiplication for the connectives of logic, and published his thoughts in 1854. His symbols let logical statements be simplified.

**What is Boolean algebra and how does it work with 1 and 0?**

Boolean algebra reduces truth and falsehood to two values: 1 for true and 0 for false. Its three basic operations are AND, OR and NOT, and it contains no subtraction or division. OR behaves much like addition, except that 1 + 1 still equals 1.

**What are the three basic operations in Boolean algebra?**

They are AND, OR and NOT, written with the symbols ∧, ∨ and ¬. Boole believed these were the only operations needed, alongside basic mathematical functions, to carry out set comparisons. "A AND B" is true only when both parts are true; "A OR B" is true when at least one is.

**How did Claude Shannon use Boolean algebra in his 1938 thesis?**

About 70 years after Boole's death, Claude Shannon, a 21-year-old American engineer, showed in his master's thesis how Boolean algebra could simplify electrical systems. His work, "A Symbolic Analysis of Relay and Switching Circuits," was published in 1938 and pointed toward the direction the twentieth century would take.

**Why do computers use binary true and false logic?**

Computers cannot read words or numbers the way we do, so they encode data in binary, using only 1 and 0. Binary arithmetic's multiplication table is far simpler than the decimal one, which suits electronic switching circuits. In those circuits, 0 means false or no current, and 1 means true or current.

**How is Boolean algebra used in search engines today?**

Boolean logic sits at the center of how internet search engines work. In the early internet, AND, OR and NOT commands were widely used to filter results, and even today's natural-language search runs on the same underlying system. A search for "George Boole" carries an invisible AND between the words, so only pages containing both names appear. Editorial note: Details that remain unconfirmed are presented here as such, and no facts have been invented to fill the gaps.

Canonical: https://curio.madeda.com/george-boole-the-shoemaker-s-son-who-invented-boolean-algebra/