causal
Categoricity of Arithmetic Begs the Question
Dedekind's categoricity theorem proves that any two models of his second-order arithmetic are isomorphic, supposedly grounding a definite concept of finiteness; but because the crucial induction axiom quantifies over arbitrary sets of numbers, the definiteness of finite arithmetic is grounded in the definiteness of 'arbitrary set,' so if set theory is itself indefinite or pluralistic, the categoricity argument cannot establish definiteness or monism in arithmetic — different models of set theory have standard arithmetic models satisfying different truths.
causalpending
Speaker
Joel HamkinsEvidence Quote
“if we think that there's indefiniteness or pluralism in set theory, then it can't possibly work to establish definiteness or monism in arithmetic.”
Created: 6/13/2026, 12:16:57 AM
Your notes
Loading notes...