The story
In 1931 a 24-year-old Austrian logician, Kurt Gödel, published a paper in Vienna showing that mathematics has a built-in limit. His first incompleteness theorem says that any consistent formal system strong enough to express ordinary arithmetic contains true statements that the system cannot prove. His second theorem says that such a system cannot prove its own consistency. He had first announced the result at a conference in Königsberg in September 1930, where the mathematician John von Neumann was among the few who grasped its importance at once.
The background was a quest for certainty. Around 1900 David Hilbert had asked mathematicians to prove arithmetic consistent, and his program aimed to place all of mathematics on a finite, mechanical foundation. Gottlob Frege, then Bertrand Russell and Alfred North Whitehead in Principia Mathematica (1910 to 1913), had tried to derive mathematics from pure logic, building on Boolean logic. Many expected that a system like Principia could in principle settle every mathematical question, so that every true statement would have a proof.
Gödel's method was ingenious. He assigned a number to every symbol, formula and proof, so that statements about proofs become statements about numbers, which arithmetic itself can express. He then built a sentence that in effect says 'this sentence is not provable in this system'. If the system could prove it, the system would be inconsistent, and if it cannot, the sentence is true but unprovable. The result did not mean that mathematics is unreliable, but it ended the hope of Hilbert's program in its original form and showed that no fixed set of axioms captures all mathematical truth. Within five years Alonzo Church and Alan Turing used related ideas to prove that some problems cannot be solved by any mechanical procedure, which helped found computer science. Gödel later moved to the Institute for Advanced Study in Princeton, where he became a close friend of Albert Einstein.
Why it mattered
- Alan Turing's 1936 Turing machine and its proof that the halting problem is undecidable built directly on Gödel's technique.
- Church's lambda calculus of 1936 gave a second formal definition of computability, in the same spirit.
- Hilbert's program to prove mathematics consistent by finite means was shown to be impossible in its original form.
- Philosophers and scientists have debated whether the theorems limit human or machine thinking, a debate still alive in discussions of artificial intelligence.
Sources
- Gödel's Incompleteness Theorems Stanford Encyclopedia of Philosophy
- Kurt Gödel Britannica
- Kurt Gödel and the Institute Institute for Advanced Study
- Oskar Morgenstern's account of Kurt Gödel's naturalization Institute for Advanced Study Archives
Drafted by AI (Claude) from the sources above and checked against them by AI; no historian has reviewed this page. Spot a mistake? Suggest a correction. How pages are made
Community notes
Loading notes…