AI unlocks Gödel's notebooks with proved theorems
Archived — this story has rotated out of today’s deck. It is kept here in full.
The gist
Logician Jan von Plato fed Gödel's 1,009-page notebooks to Claude, which extracted 663 theorems.
The find tests how far AI can open unpublished work.
Background
Kurt Gödel was an Austrian mathematician, author of the incompleteness theorems and described as one of the greatest mathematical minds of the 20th century. In the early 1940s he filled 16 notebooks — the "workbooks", 1,009 densely written pages — much of it in Gabelsberger, an obsolete German shorthand. Finnish logician Jan von Plato has led a Helsinki University project to understand them since 2017; before AI, progress ran at about a page a week.
How it unfolded
- 1931Gödel publishes his two incompleteness theorems, the work that made his name.
- early 1940sGödel writes 16 notebooks, the "workbooks": 1,009 pages on maths and logic, much in the obsolete German shorthand Gabelsberger.
- 1966American mathematician Paul Cohen receives the Fields Medal for resolving fundamental questions in set theory; Gödel said he had already proved the result in the 1940s but could not reconstruct a proof when pushed by peers.
- 2017Jan von Plato begins leading a Helsinki University project to understand the notebooks' contents.
- Aug 2026At a conference in France on AI and theorem proving, von Plato meets computer scientists who suggest he use Claude.
- Sep 2026Von Plato gives Claude his transcriptions, six books he wrote on Gödel and other secondary literature; within a couple of days the model produces a 650-page explanation of the workbooks.
- Nov 13, 2026The Guardian reports the story: Claude extracted 663 theorems for which Gödel had a proof, a sketched proof or an idea; in the Coq proof assistant about 400 verified as stated, about 200 were repaired and about 50 were false.
- Nov 13, 2026Claude reconstructed a proof of the independence of the axiom of choice that was one definition short of complete; the repaired proof passed Coq.
Key terms
- incompleteness theorems
- Two mathematical logic theorems showing that formal axiomatic systems have limits on what can be proven within them.
- Gabelsberger
- A form of shorthand once common in Germany and Austria, created around 1817 by Franz Xaver Gabelsberger.
- Coq proof assistant
- An interactive theorem prover that lets users state mathematical assertions and mechanically check formal proofs.
Source: Wikipedia
Who’s saying what
- Expert
- Project leader Jan von Plato said he was "flabbergasted", that the workbooks anticipate dozens of results not published until the 1970s and 1980s, and that the 650-page explanation was "basically a work that is impossible to do for human beings".
- Caution
- Joel David Hamkins, a Notre Dame professor of logic who has not seen the reconstruction, said it would be "remarkable and historically interesting" if it held up, but "how much is Claude and how much is Gödel is a job for the historians".
Still unverified
Whether Gödel actually proved the independence of the axiom of choice in the 1940s is disputed; researchers caution his unfinished argument does not establish he had proved the result. Joel David Hamkins has not seen Claude's reconstruction and said historians must determine how much is Gödel's contribution and how much is AI's. The Guardian's account does not say which Claude model von Plato used or whether he worked with Anthropic directly.