1931
Gödel publishes incompleteness theorems
Kurt GödelKurt Gödel — his incompleteness theorems showed limits on what formal mathematics can prove.'s 1931 paper in Monatshefte für Mathematik und Physik proved that any consistent formal system rich enough for arithmetic must contain true statements it cannot prove.
What it was for
GödelKurt Gödel — his incompleteness theorems showed limits on what formal mathematics can prove.'s theorems ended HilbertDavid Hilbert — posed foundational questions for mathematics, including the Entscheidungsproblem.'s program of complete axiomatic foundations for mathematics and set limits on what algorithms can ever decide. The proof technique — encoding statements about proofs as numbers — foreshadowed how computers represent logic and data.
People
- Kurt Gödel — researcher
Why it's here
Incompleteness is one of the deepest results linking mathematics, logic, and computation.
Why it mattered
It showed formal systems have inherent limits — a backdrop for TuringAlan Turing — mathematician who defined computability, broke Enigma, and posed the imitation game. and Church's work on decidability.
What it solved
Mathematicians wanted to know whether every true statement could be proved from a fixed set of axioms.
Media
ImageKurt GödelPublic domain, via Wikimedia Commons