Departure question
Test the floor beneath mathematicsPort 6 of 8Meet paradox, incompleteness, and independence in attempts to build a foundation for mathematics from sets.
This voyage is an editorial path for understanding, not a claim of direct historical influence or sole invention.
A consistent, effectively axiomatized formal system strong enough for arithmetic has sentences it cannot prove and, under the theorem's stated conditions, cannot prove its own consistency. Gödel announced the first result at 24 in 1930 and stated both theorems in his 1931 paper.
System | Strength | Gödel’s theorem applies? | Consequence |
|---|---|---|---|
Presburger arithmetic (addition only) | Weak | ✗ — complete and decidable | Computable; every truth is provable |
Turing-machine halting problem | Computation model | Separate theorem | Turing’s 1936 undecidability result |
Peano arithmetic (PA) | Strong | ✓ First incompleteness theorem | Truths of PA that cannot be proved within PA |
ZFC set theory | Very strong | ✓ (assuming consistency) | CH independence is a separate result of Gödel and Cohen |
Propositional logic | Weak | ✗ — decidable | SAT-solving algorithms |
A consistent, effectively axiomatized formal system strong enough for arithmetic has sentences it cannot prove. The halting problem and CH independence are related but distinct results.
A consistent, effectively axiomatized formal system strong enough for arithmetic has sentences it cannot prove and, under the theorem's conditions, cannot prove its own consistency.
Ports in time
Follow the scenes to see problems, notation, standards of proof, and applications changing across different times and places.
In the early 1920s Hilbert proposed formalizing classical mathematics axiomatically and justifying its consistency by finitary methods.
No reliable place is given, so time continues without an invented pin
Continue through the world of this yearAfter announcing the first result in Königsberg in 1930, Gödel’s 1931 paper stated both incompleteness theorems and exposed limits to the aims of Hilbert’s program.
No reliable place is given, so time continues without an invented pin
Continue through the world of this yearTuring proved that no general algorithm can determine whether every possible program will halt — a distinct limit result about computability.
No reliable place is given, so time continues without an invented pin
Continue through the world of this yearA statement about ordinary natural numbers was shown to be unprovable within Peano arithmetic, giving a concrete example beyond Gödel’s deliberately self-referential construction.
No reliable place is given, so time continues without an invented pin
Continue through the world of this yearUndecidability and the halting problem, debates about the limits of AI, limits of formal verification, and the analysis of self-referential systems.
Curated sources and problems. Bring one discovery back from OEIS, Project Euler, MathOverflow, or arXiv.
No concept belongs to one person
These are not inventor credits. They are different ports: opening a problem, sharpening a language, or carrying it into another world.
Number lenses
These numbers are editorial lenses for the voyage, not required prerequisites.
Meet paradox, incompleteness, and independence in attempts to build a foundation for mathematics from sets.
Open the number voyage
Meet paradox, incompleteness, and independence in attempts to build a foundation for mathematics from sets.
Open the number voyage
Meet paradox, incompleteness, and independence in attempts to build a foundation for mathematics from sets.
Open the number voyage
Concept genealogy
Concepts arriving from before
Current port
Incompleteness Theorems
Concepts opened from here
No direct successor port is curated yet.
Only direct editorial links are shown; this is not a complete learning order or historical influence line.
