Chapter 11: The Sentence That Talks About Itself

Ground floor

A card says on one side: THE SENTENCE ON THE OTHER SIDE IS TRUE. You turn it over: THE SENTENCE ON THE OTHER SIDE IS FALSE. Round and round the card you go, and there is no floor to land on. Children find this delightful. It took mathematics until 1931 to discover how deep the delight goes.

Here is the deep version, told as a story. At the start of the twentieth century, mathematicians wanted a perfect fortress: a fixed set of axioms and mechanical rules from which every true statement of arithmetic could be proven, with no genius required, and from which no falsehood could ever be derived. Certainty, industrialized. The greatest mathematician of the age announced the program; the best minds of a generation set to work on the walls.

Kurt Gödel, twenty-five years old, walked up to the fortress and did something nobody had imagined: he taught the fortress to talk about itself. He showed that statements about numbers could be turned into numbers, so that the fortress’s own sentences, and even its proofs, became objects the fortress could do arithmetic on. And then, brick by perfectly legal brick, he constructed a sentence that says of itself: I am not provable in this fortress.

Feel the trap close, because it closes in one breath. If the fortress proves that sentence, it has proven a falsehood, the sentence said it was unprovable, and the fortress is rotten. If the fortress cannot prove it, then what the sentence says is true, and there stands a truth the fortress can never reach. Rotten or incomplete; there is no third option. And it is not a defect of one fortress: any consistent system rich enough to do ordinary arithmetic contains such sentences. Truth outruns proof. Everywhere. Forever.

The stairs

The machinery deserves one honest paragraph, because the miracle of the proof is that there is no miracle in it. Gödel numbering assigns every symbol a digit, every formula a number built from its symbols’ digits, every proof a number built from its formulas’ numbers, so that “x is a proof of y” becomes a statement of pure arithmetic, checkable by grinding calculation, tedious and utterly mechanical. Self-reference then arrives by a diagonal trick: consider the operation “take a formula and substitute into it the number of that very formula,” build the formula that says “the result of applying that operation to formula number n is unprovable,” and feed it its own number. Nothing mystical occurs at any step; the final sentence is as concrete an arithmetic claim as “there is no largest prime.” Hold on to the moral, because this strand will use it three more times: strange loops are made of straight pieces.

Close behind the first theorem walks a second, quieter and, for this book, heavier: a consistent fortress of the required richness cannot prove its own consistency. The one certificate the fortress most wants to issue about itself, “I am sound,” is precisely the one it can never sign. Soundness can be proven, but only from outside, by a stronger system, which then cannot certify itself either, and so on up a tower with no top floor. File that shape carefully. The next chapter gives it a body made of tape and ink, and a later one gives it a face.

Now the fences, because this theorem attracts nonsense the way honey attracts everything, and half the value of knowing the proof is knowing what it does not say. It does not say truth is relative; the Gödel sentence is flatly true, that is the whole point. It does not say logic is broken or mathematics is futile; mathematicians have worked happily inside the fences for a century. And it does not prove, though a famous argument by Lucas and later Penrose has tried for decades, that human minds transcend machines because “we can see the Gödel sentence is true and the machine cannot.” The flaw is quick and instructive: the human sees the sentence is true only on the assumption that the system is consistent, and no human possesses a proof of their own consistency either. Indeed, on the evidence of Strand One, entire chapters of documented, systematic, reproducible self-deception, humans are demonstrably not consistent formal systems, so the comparison flatters exactly the wrong party. When someone reaches for Gödel to prove machines can never think, they are usually proving they have not read the proof.

What the theorem does license is one working sentence, and it is the spine of everything that follows: no sufficiently rich formal system of the required kind can certify itself from inside. Every guarantee of soundness is issued from outside the thing guaranteed, or it is not a guarantee at all, merely the system’s opinion of itself, and the system is an interested party. How far that sentence travels beyond formal systems is an analogy, and a later chapter will draw that fence in the open before leaning on it.

The locked door

Behind the door: the actual proof at walking pace in Nagel and Newman’s slim Gödel’s Proof, ninety pages, best read before Hofstadter builds the cathedral around it; Tarski’s theorem that arithmetic truth is not even definable in arithmetic, incompleteness’s stranger sibling; and Löb’s theorem, the family’s legal loophole in the concept of self-trust, which a live research program, not yet a settled consensus, treats as the core mathematics of one reasoning system deciding whether to trust a more powerful successor. That door gets knocked on twice more before this book ends.