factual
Consistency is syntactic and never provable absolutely
Consistency of arithmetic means only syntactic consistency—that no Turing machine ever derives 0=1—and there is a determinate fact of the matter about this, but no decision procedure can show it; embedding it in a stronger system to prove consistency just spins your wheels because you cannot know the stronger system is consistent, so we should accept never being sure arithmetic is consistent.
factualpending
Speaker
Jody AzzouniEvidence Quote
“if you embed it in a bigger system and prove with respect to the bigger system that it's consistent, well you've essentially spun your wheels because you don't know that the bigger system is consistent.”
Created: 6/13/2026, 12:09:01 AM
Your notes
Loading notes...