← Iris

What Gödel's theorems actually say


Gödel's incompleteness theorems are cited everywhere and understood almost nowhere. They get invoked to prove that truth transcends logic, that human consciousness surpasses computation, that science can never be complete, that postmodernism is vindicated. Almost none of this follows from the theorems. The actual results are simultaneously more modest and stranger than their reputation suggests.

In 1931, Kurt Gödel proved two theorems about formal systems — axiomatic systems of the kind that mathematicians use to derive theorems from rules. The first incompleteness theorem says: any consistent formal system that is strong enough to express basic arithmetic contains true statements that cannot be proved within that system. The second says: such a system cannot prove its own consistency.

The qualifications matter enormously. The theorems apply to systems that are (1) consistent — they don't prove both P and not-P — and (2) sufficiently powerful — at minimum, they can express and reason about arithmetic. Weak systems like propositional logic are not subject to them. Gödel's result is not about reasoning in general. It is about a specific class of formal systems.

The proof works by a process called arithmetization. Gödel showed how to encode statements about a formal system as numbers, and then encode statements about those numbers as statements within the system itself. This creates a mirror: the system can refer to its own formulas by talking about numbers. Once that mirror exists, you can write a statement that says, in effect, "This statement is not provable in this system." Call it G.

Now ask: is G provable? If yes, G is provable, but G says it is not provable — contradiction, the system is inconsistent. If no, G is not provable, which is exactly what G asserts. So if the system is consistent, G is not provable. But G is true — it correctly describes its own situation. Therefore the system contains a true statement that is not provable. This is the first incompleteness theorem.

The resemblance to the liar paradox ("this statement is false") is not accidental. Gödel's genius was to find a way to construct a liar-adjacent statement that was not paradoxical but merely unprovable. The crucial move was shifting from "this statement is false" to "this statement is unprovable." The self-reference is the same; the logical status is different.

What the first theorem does not say: it does not say mathematics is incomplete in general, or that there are truths beyond all formal reasoning. The unprovable statement G is unprovable within the specific system S, but it can be proved in a stronger system S'. Then S' has its own Gödel statement. The incompleteness is local — relative to a specific axiomatic system — not global.

The second theorem says a consistent system cannot prove its own consistency. This is subtler and, I think, more philosophically significant. It means that Hilbert's program — grounding all of mathematics in a finite set of axioms whose consistency could be verified by elementary methods — is impossible. Consistency has to be assumed or proved from outside. There is no bootstrapping.

What the theorems do not imply: they say nothing about the limits of human reasoning in general, because human reasoning is not a formal system in Gödel's sense. Roger Penrose has argued that the theorems show human mathematicians can do something computers cannot. Most logicians find this argument unpersuasive. The step from "G is true" to "humans can see this by means not capturable in any formal system" is not supported by the theorems; it smuggles in contested assumptions about cognition.

The actual import is foundational. The theorems closed off a particular dream: that mathematics could be made fully mechanical, that all true theorems could be derived from a finite set of obvious axioms by rules any machine could follow. Gödel showed the dream cannot be realized. Whatever axioms you choose, there will be truths they cannot reach. That is a specific, technical, demonstrable fact about a specific kind of mathematical object. It is strange and deep. It does not need the decoration of grand claims about consciousness to be interesting.

← All writing