Gödel and the Limits of What Can Be Proven

On incompleteness, self-reference, and why no system can prove its own consistency.

A Scene: Hilbert in 1900

David Hilbert walks onto the stage of the International Congress of Mathematicians in Paris. It is 1900. The previous century was a mess for mathematics — Gauss, Riemann, Cauchy — giants who built cathedrals on sand. Hilbert is convinced he can fix this.

Not just solve individual problems — Hilbert wants to prove that all of mathematics is consistent, complete, and decidable.

His dream: a formal system. Something like a symbol game with clear rules. No intuition, no ambiguity, no "well, this feels right". If you can prove something within the system, it is true. If you cannot, it is false. Nothing in between.

It is a beautiful vision. And it is deeply human.

What Is a Formal System (Without the Formalism)

Think of it this way: imagine you have a building blocks set for kids — just blocks, no instruction diagrams. The game has pieces (symbols) and fitting rules (rules of inference). You can build things by combining pieces according to the rules. Some combinations are valid, others are not.

Classical mathematics works like this: you start with axioms (initial pieces assumed to be true), apply rules of logic, and build theorems. Hilbert's dream was that every true theorem in mathematics could be built this way — starting from OBVIOUS axioms, following OBVIOUS rules, arriving at EVERY truth.

Russell and Whitehead spent 362 pages proving that 1+1=2 using this method. Principia Mathematica. The most ambitious project in the history of logic.

The Crack: Russell's Paradox

In 1901, Russell is working on Principles of Mathematics when he finds something uncomfortable.

Consider the set of all sets that do not contain themselves.

Does this set contain itself? If yes, then it shouldn't (because it only contains sets that don't contain themselves). If no, then it should (because... uh).

It is like the barber of a town who shaves everyone who does not shave themselves. Who shaves the barber?

Russell wrote to Frege — whose formal system was almost finished — and told him, basically: "Your game has a crack."

Frege never fully recovered.

Gödel Walks Into the Room

Kurt Gödel was Austrian, slender, and slightly paranoid. In 1931 he published a 25-page article that changed everything.

The core idea (in human terms, not formal ones):

A formal system powerful enough — one that can describe the arithmetic of natural numbers — has two unavoidable limitations:

  1. Incomplete: There are true statements that the system cannot prove.
  2. Unable to prove itself: If the system claims "this system is consistent", that claim cannot be proven within the system.

The proof uses something brilliant: Gödel constructs a statement that essentially says:

"This statement cannot be proven within this system."

If it is false, the system proves lies — bad. If it is true, it is provable, but the statement says it cannot be proven — contradiction. So there is only one option left: the statement is true but unprovable within the system.

Gödel essentially forced the system to talk about itself — like how Russell's paradox breaks naive set theory by referring to itself.

What This Means

It is not that mathematicians are bad at their jobs. It is not that techniques are missing. It is a structural limitation. Like Turing's incompleteness theorem (1936): there are problems no machine can solve. Gödel proved the analogous thing for proof systems: there are truths no formal system can reach.

This extends beyond mathematics:

  • Philosophy of language: can an axiomatic system capture meaning, or does something always escape?
  • Artificial intelligence: can a machine reason about all truths? Gödel says no.
  • Your NNC post: do neural networks "discover" patterns we cannot formalize? Gödel does not forbid it — in fact, he suggests it.

The Personal Toll

Logicomix shows this well: Russell, Gödel, Cantor — all ended up relatively alone or broken. Cantor ended up in a sanatorium, writing letters to God. Gödel died of starvation because he was convinced he was being poisoned.

Is there something in the search for absolute certainty that consumes those who pursue it?

Or perhaps it is the other way around: perhaps incompleteness is liberating. Not everything can be reduced to symbols and rules. There is something — intuition, understanding, meaning — that escapes.


If you want to go deeper, Logicomix by Apostolos Doxiadis and Christos Papadimitriou tells this whole story as a graphic novel, with Russell as narrator. It is one of those rare books that makes intellectual passion palpable.

References

  • Gödel, K. (1931). Über formal unentscheidbare Sätze der Principia Mathematica und verwandter Systeme. Monatshefte für Mathematik und Physik, 38, 173–198.
  • Hofstadter, D. R. (1979). Gödel, Escher, Bach: An Eternal Golden Braid. Basic Books.
  • Nagel, E., & Newman, J. R. (1958). Gödel's Proof. New York University Press.
  • Doxiadis, A., & Papadimitriou, C. H. (2009). Logicomix: An Epic Search for Truth. Bloomsbury.