factual
Gödel Incompleteness Refutes Hilbert's Program
Gödel's two incompleteness theorems decisively refute Hilbert's program: the first shows no computably axiomatizable theory containing enough arithmetic can answer all questions (every such consistent theory is incomplete), and the second shows no such theory can prove its own consistency.
factualpending
Speaker
Joel David HamkinsEvidence Quote
“the first incompleteness theorem says you cannot write down a computably axiomatizable theory that answers all the questions. Every such theory will be incomplete, assuming it includes a certain amount of arithmetic. And secondly, no such theory can ever prove its own consistency.”
Created: 6/13/2026, 3:33:58 AM
Your notes
Loading notes...