Gödel's incompleteness theorems (1931)
Kurt Gödel published two theorems showing that any consistent formal system strong enough for arithmetic contains true statements it cannot prove. The result undercut the effort to ground all mathematics in a finite set of axioms.
Mathematicians absorbed the limits of formal proof.
The theorems became foundational to logic and computer science.
They are why Gödel's unpublished notebooks draw attention: even fragmentary work from him may contain results nobody else reached.
