How Charles Peirce Taught Logic to Handle Relationships

When Logic Hit a Wall: Properties Aren’t Enough

You and a friend are solving a logic puzzle with cards that say things like “every detective trusts a witness.” You have new evidence: “Kim is a detective.” The conclusion that Kim trusts some witness feels obvious. But then the card says “some detective trusts every witness.” Now you freeze — the meaning depends on who trusts whom, not just what each person is. That shift from one-place facts to two-place connections is where logic got stuck for over two thousand years.

Ancient Greek philosophers, especially Aristotle (384–322 BCE), built a powerful system of reasoning. It handled sentences like “All humans are mortal” or “No fish is a mammal.” In each case, you are talking about a single subject and a single property — what logicians call a monadic predicate. Aristotle’s rules let you string those together into clear arguments. But try to express “John loves Mary” as a monadic sentence. You can’t. “Loves” isn’t a property one person wears like a hat; it’s a relation that ties two things together. That kind of statement is polyadic (from Greek polys, meaning many). Polyadic logic deals with relations involving two, three, or more individuals. Without it, you can’t reason about friendship, order, or even simple arithmetic — because “is greater than” is a relation, not a property of a single number.

The problem wasn’t that nobody noticed. Mathematician Augustus De Morgan (1806–1871) insisted that logic had to study relations, but he couldn’t find a notation to make it work. He was stuck trying to force relational reasoning into the old Aristotelian mold of subject and property. Meanwhile, George Boole (1815–1864) created a beautiful algebra for logic, but it only handled monadic predicates and their combinations. The wall remained.

The Big Leap: From “is a Man” to “Lover of a Woman”

Charles Sanders Peirce (1839–1914) saw that the wall had to come down. He admired Boole’s algebraic method, but he knew that real reasoning constantly involves relations. If you want to capture “every mother of a toddler is tired,” you need to talk about two things (mother and toddler) and how they connect. Peirce’s big idea was to extend Boole’s algebra so it could handle polyadic predicates. This wasn’t just adding a few new symbols; it was leaping into a new logical territory.

In his 1870 paper Description of a Notation for the Logic of Relatives, Peirce introduced a way to multiply predicates. He defined something like “l w” to mean lover of some woman. The “l” is a two-place relation (someone loves someone) and “w” is a one-place property (being a woman). The result is a new property: the class of people who love at least one woman. Notice what just happened — that little expression silently smuggles in the word “some,” a quantifier. Peirce hadn’t yet named it, but he had created a notation where an existential quantifier appears naturally when a relation applies to a predicate.

Soon he made the quantifiers explicit. He represented “some” with a large sigma (Σ), like a logical sum over individuals. “Every” became a large pi (Π), like a logical product. The sentence “every boy loves some dog” could be written as Π_i Σ_j (boy_i × loves_i,j × dog_j). The indices (i and j) keep track of which person is which. This might look like math, but it’s actually a way to precisely express relationships that older logic couldn’t touch. A single formula could now distinguish “everyone loves someone” from “there is someone everyone loves” — two claims that are totally different in meaning, yet impossible to separate in a monadic system.

Gottlob Frege (1848–1925) invented quantifiers independently around the same time, but Peirce’s motivation was directly tied to relations. For Peirce, the need to reason about connections, not a love of pure formalism, drove the whole project. His algebraic approach also made it easy to see logical operations as computations, which later blossomed into the way we program computers.

Drawing Relations: Peirce’s Existential Graphs

Peirce believed that a good notation doesn’t just record thoughts — it helps you think. So after he had a working symbolic language for relations, he did something even more radical: he invented a diagrammatic logic where relations are drawn as visible lines. He called these Existential Graphs. The system had no sentence-like formulas. Instead, you wrote simple diagrams on a sheet of paper, and you proved things by transforming them with rules that felt almost like doodling.

A relation such as “loves” becomes a word with a number of free ends, like a chemical atom with loose bonds. “Loves” has two ends; “gives” (as in “X gives Y to Z”) has three. Those ends can be connected by lines of identity to show that the same individual fills two roles. If a line links “boy” and “loves,” the diagram says that some boy loves someone. But if that line is enclosed inside a special loop (a cut), the meaning flips — it now says every boy loves someone. The depth of the line in the nest of cuts tells you whether it means “some” or “every,” and how wide its scope is. You don’t need to juggle variable letters; the picture itself does the work.

Peirce thought this method was the crown jewel of his career. By turning logic into a visual activity, he showed that the form of representation matters. A web of lines makes it instantly clear who is connected to whom, and how the quantifiers interact. Whether a relation is transitive (if A loves B and B loves C, does A love C?) can sometimes be seen at a glance. He was applying his own rule for clear thinking: to understand an idea, see what effects it has and what reasoning it allows. A well-drawn diagram, he argued, lets you observe the consequences of a relation.

Why Your Phone’s Search Bar Owes a Debt to Peirce

You might think this is ancient history, but Peirce’s leap into polyadic logic is humming inside every digital device you use. When you type a search like “books by authors born in the same city as a poet,” you’re asking a relational question. A database couldn’t answer it if it only stored one-place facts. Under the hood, search engines and AI systems translate your request into a form of first-order logic — the very kind of logical system Peirce pioneered. The ability to handle relations is what lets a computer join pieces of information across different categories.

Even in everyday life, polyadic logic is at work. When a friend says, “Tell me one thing that everyone in this room agrees on,” your brain instantly searches for a relation (agreeing about something) that holds for every person. You might not realize it, but you’re thinking with the same abstraction Peirce formalized. His basic insight — that relations require a different kind of logical tool — still shapes how mathematicians prove theorems, how linguists model meaning, and how programmers build smart software.

More than any specific notation, Peirce gave us a habit of mind: when a problem feels impossible, ask whether you’re using the right representation. He showed that inventing a new way to write down ideas can expand what you can think. That’s why, even though his diagrams look old-fashioned, the question they raise is completely alive: what other kinds of reasoning might open up if we stopped writing everything in tidy lines of text?

Think about it

1. If you tried to describe your family tree using only one-place properties like “is a mother” or “is a daughter,” what would be impossible to say?
2. Peirce believed that drawing relations as lines made them easier to understand than using symbols. Do you think a picture of “every cat loves some fish” would be clearer than a sentence? Can you imagine a relation that a picture might make more confusing?
3. Can you invent a rule for a new diagram system that shows a three-way relationship (like “X introduces Y to Z”) more clearly than words or standard algebra? What would its hardest puzzle be?