Can You Solve an Argument with an Equation? The Algebra of Logic
An Argument Like a Math Problem?
Imagine you and a friend are arguing about who has the better taste in music. You line up your reasons, they push back, and soon you’re stuck in a circle. Now imagine instead that you could write the whole argument as an equation, something like x + y = good music, and then solve it step by step until the answer just falls out. No more shouting — just math.
That sounds like science fiction, but it’s exactly what a quiet English mathematician named George Boole (1815–1864) tried to achieve in the 1840s. He wasn’t interested in music or everyday bickering. His target was the ancient art of syllogistic logic — the system built by Aristotle more than two thousand years earlier, where you reason from statements like All birds have wings and A robin is a bird to the conclusion A robin has wings. For centuries, students had to memorize a catalog of valid argument forms, each with its own Latin name, like Barbara and Celarent. Boole thought this was little more than a memory trick. He wanted a proper science of reasoning — and he set out to build it using the same algebra you now learn in middle school.
Boole’s big idea was to treat logical arguments as equations involving classes of things. The class birds, the class winged things, the class robins — all could be turned into symbols like X, Y, and Z and manipulated according to algebraic rules. If it worked, you wouldn’t need to memorize a list of good arguments. You could just calculate whether an argument was valid, the way you calculate that 3x = 6 means x = 2.
Boole’s Symbolic Code
Boole laid out his system in two books, The Mathematical Analysis of Logic (1847) and The Laws of Thought (1854). He started with ordinary algebra — the one you know with addition, subtraction, and multiplication — and gave the symbols a new meaning. Instead of standing for numbers, they stood for classes of things: red apples, mammals, planets, anything you could group together.
To make algebra work with classes, he had to assign meanings to the basic operations. Multiplication became intersection: XY meant the things that are both X and Y — like the class of things that are both red and apples. This led to a new law that doesn’t hold in ordinary number algebra: the idempotent law, XX = X. In number algebra, the only numbers that satisfy x·x = x are 0 and 1. But Boole insisted that for classes, picking out the red apples and then picking out the red apples again just gives you the red apples. There’s no doubling.
Addition was trickier. Boole defined addition as union only when the two classes had no members in common — for instance, the class of cats plus the class of dogs makes sense if no animal is both a cat and a dog. If there was any overlap, he called the sum uninterpretable, a ghostly expression that didn’t refer to anything real but could still be manipulated during the solving process, as long as the final answer came out clean.
He also turned the four basic kinds of categorical statement into equations. All X is Y became X = XY. No X is Y became XY = 0. For statements like Some X is Y, which assert that at least one thing belongs to both classes, he introduced a special placeholder symbol V, writing V = XY to mean that the intersection isn’t empty. Then, just as you might solve for x in algebra class, Boole would solve for the conclusion of a syllogism. If the algebra produced an equation that matched a real statement, the argument was valid.
To prove his system’s power, Boole developed the Elimination Theorem. It was a mechanical recipe: given a messy equation involving many class symbols, you could eliminate the ones you didn’t care about by plugging in 0s and 1s in all possible ways, then multiplying the results together. This gave you the most general conclusion that followed from the premises — a single algorithm to handle infinitely many possible arguments, something no catalog could ever do.
The Problem with Half-Built Operations
Boole’s system was brilliant, but it had serious cracks. The biggest one was that his operation of addition only worked when classes were disjoint. In ordinary math, you can add any two numbers without worrying about overlap. Boole’s rule meant that you couldn’t freely combine ideas like expensive things and useful things, because some things are both. Critics started asking whether Boole’s algebra was truly a general logic, or just a clever trick that happened to look like algebra until you pushed too hard.
There was a deeper worry, too. Boole allowed those “uninterpretable” expressions to show up in the middle of a derivation. You might arrive at an answer about horses and shoes, but along the way you’d be solving equations with terms that didn’t correspond to anything real. Was this legitimate? Boole himself defended the practice by pointing to complex numbers, where mathematicians had long worked with the supposedly meaningless √–1 and still gotten correct results. But the unease remained: if logic is about what’s true and false, what business do uninterpretable symbols have in a logical proof?
These questions show that Boole was, in a way, brilliant but not fully sure why his system worked. He experimented with alternative laws — what if, instead of X·X = X, the rule were X·X·X = X? — and he toyed with different foundations. At one point he even adopted a simple but mysterious “Rule of 0 and 1,” which said that you could check any argument by testing whether it held when the class symbols were replaced with just the numbers 0 and 1. The rule seemed to work, but he never gave a satisfying explanation for why it was the true foundation of logic. The system needed a mechanic.
Jevons’s Fix: A Logic You Can Always Build
The first major overhaul came from a young logician named William Stanley Jevons (1835–1882). He had studied with Boole’s rival Augustus De Morgan and saw instantly where Boole’s system buckled. Jevons insisted that the operation of addition should always be just ordinary union — the “inclusive or” that we use today when we say “I’ll have cake or ice cream” and might mean either or both. In Jevons’s version, X + X equals X, not 2X. This broke the tie to ordinary number algebra completely. Jevons proudly called his system a “pure” logic, based directly on the ways ideas combine, not borrowed from arithmetic.
Jevons also cleaned up the rules of reasoning. Over many years he worked out the basic laws of what we now call Boolean algebra. He listed the reflexive law (A = A), symmetry (if A = B then B = A), and the law of substitution — that you can replace equals with equals — which became the single rule for deriving new equations. He even explained why “A and not A” equals nothing, a principle he called the Law of Contradiction. His final system, scattered across his 1874 book The Principles of Science, looks remarkably like the logic that would later be etched into silicon.
By insisting that every operation had to work for any classes, Jevons turned Boole’s risky, half-legal algebra into a stable, self-contained system. He grounded it in ground terms — class symbols treated as constants rather than variables that can take any value — and showed that all the valid forms of traditional logic could be derived from clear, mechanical rules. The algebra was no longer a shadow of arithmetic. It was its own science.
Peirce Takes the Big Jump: From Classes to Quantifiers
While Jevons was tidying up the operations, an American polymath named Charles Sanders Peirce (1839–1914) pushed the algebra of logic in a radically new direction. Peirce agreed with Jevons that union should be unrestricted, but he also believed that basing logic on equality was too limiting. Instead, he made the fundamental relation subsumption — the idea that one class is contained in another. He used a symbol that looks like a curved “less than” sign (–<) to mean “implies” or “is contained in.” From this, he could define union and intersection as the smallest class that contains both or the largest class contained in both, much like the modern concepts of least upper bound and greatest lower bound.
Peirce also broke with an ancient assumption that had quietly governed logic since Aristotle. In the old view, when you said “All A is B” you always assumed that there actually existed some A — that the class wasn’t empty. Peirce argued that this was unnecessary. A statement like “All unicorns have horns” could be perfectly true even if there are no unicorns, because it’s about the concept, not about what happens to be wandering around in a forest. This change in semantics — the rules about what makes a statement true — may seem small, but it turned out to be essential for the kind of logic that a computer can handle.
Most dramatically, Peirce introduced into the algebra something that Boole and Jevons never had: quantifiers. By writing an unrestricted sum over all individuals in a domain, he captured the idea of “some” (there exists at least one). An unrestricted product gave him “all.” With this mathematical notation for ∀ (“for all”) and ∃ (“there exists”), the algebra of logic could now express the full power of what we today call first-order logic — the language in which mathematics itself can be described. Peirce had, in the 1880s, unfolded a symbolic system that would become the skeleton of reasoning machines a century later.
Why Every Computer Speaks Boole’s Language
After Peirce, German mathematician Ernst Schröder (1841–1902) collected and systematized the entire achievement in his massive three-volume Vorlesungen über die Algebra der Logik (1890–1905). He refined the theory of relations, developed solution techniques for relational equations, and built an algebraic version of predicate logic. Yet even as his work was appearing, the algebra of logic was being pushed aside by a different approach — the axiomatic style of Gottlob Frege, Bertrand Russell, and Alfred North Whitehead, who used logical connectives, quantifiers, and a clean notation to build a new foundation for mathematics.
For a few decades, the algebraic tradition seemed to fade. But it came roaring back in the twentieth century, and not just among logicians. A mathematician named Marshall Stone showed in the 1930s that every Boolean algebra could be realized as a collection of subsets of some set, a result that tied the algebra of logic to the deep structure of mathematics. Meanwhile, engineers were discovering that the very same Boolean algebra — with its simple operations of AND, OR, and NOT, and its two truth-values 0 and 1 — could be built out of electrical switches. Claude Shannon’s 1937 master’s thesis made it explicit: the algebra invented by a Victorian dreamer was the perfect language for designing digital circuits.
So when you tap a button on your phone and it decides whether to show a photo or play a song, tiny electronic gates are doing exactly what Boole’s equations described: combining true and false signals according to logical laws. Your phone thinks in Boolean algebra. Boole’s dream of turning reasoning into calculation didn’t just explain old syllogisms — it shaped the digital world you live in every day.
Think about it
- If you could turn every argument you have into an equation and solve it automatically, would you trust the mathematical answer more than your own gut feeling? Why or why not?
- Boole’s algebra treats every statement as simply true or false. But what about a statement like “This pizza is pretty good” — could that ever become an equation, or is something lost when we squeeze ideas into only two values?
- Computers perform millions of Boolean operations per second, but do they really reason the way you do? If not, what’s missing?
