Kurt Gödel
1906–1978 — logician and mathematician; incompleteness theorems
Author
Logician who proved that sufficiently rich formal systems cannot prove all arithmetical truths — central limit for tier-one formal capture and tier-two claims.
Kurt Gödel (1906–1978) was an Austrian–American logician and mathematician. For this corpus, his decisive contribution is the incompleteness of formal arithmetic: no consistent, effectively axiomatised system strong enough for ordinary arithmetic can prove every truth of that arithmetic.
What we rely on
- 1931 incompleteness theorems — truth in arithmetic can exceed what any fixed proof system captures. Supports: Rⁿ at tier 0; proofs and axiom adoptions at tier 1; theorems as tier 2+ claims relative to stated axioms.
- Second incompleteness theorem (same paper) — such a system cannot prove its own consistency from within. Supports: fallibilism about formal foundations; falsify-only meta-claims about consistency.
What we do not claim
Gödel did not show that mathematics is arbitrary or that 1+1=2 is doubtful in practice. He showed limits on proof within a fixed system, not on the Real (Rⁿ).