categoricity theorem
Dedekind's result that any two models of his second-order arithmetic are isomorphic, so the theory has a unique model up to isomorphism.
As defined in 282 | Joel David Hamkins on Puzzles of Reality and Infinity
Where it comes up · 1
Most important claims · 2 of 2Search all claims for “categoricity theorem” →
- 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.282 | Joel David Hamkins on Puzzles of Reality and Infinity
- The common belief that the phrase '0, 1, 2, 3, and so on' describes a unique mathematical structure is not as clear as it seems, because the 'and so on' is hopelessly vague; to make it precise and prove uniqueness requires the Dedekind categoricity theorem, but that theory's induction axiom quantifies over arbitrary sets of numbers.282 | Joel David Hamkins on Puzzles of Reality and Infinity