Categoricity, Open-Ended Schemas and Peano Arithmetic

Logos and Episteme 6 (3):313-332 (2015)
  Copy   BIBTEX

Abstract

One of the philosophical uses of Dedekind’s categoricity theorem for Peano Arithmetic is to provide support for semantic realism. To this end, the logical framework in which the proof of the theorem is conducted becomes highly significant. I examine different proposals regarding these logical frameworks and focus on the philosophical benefits of adopting open-ended schemas in contrast to second order logic as the logical medium of the proof. I investigate Pederson and Rossberg’s critique of the ontological advantages of open-ended arithmetic when it comes to establishing the categoricity of Peano Arithmetic and show that the critique is highly problematic. I argue that Pederson and Rossberg’s ontological criterion deliver the bizarre result that certain first order subsystems of Peano Arithmetic have a second order ontology. As a consequence, the application of the ontological criterion proposed by Pederson and Rossberg assigns a certain type of ontology to a theory, and a different, richer, ontology to one of its subtheories.

Links

PhilArchive

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Internal Categoricity in Arithmetic and Set Theory.Jouko Väänänen & Tong Wang - 2015 - Notre Dame Journal of Formal Logic 56 (1):121-134.
Quantum Mathematics.J. Michael Dunn - 1980 - PSA: Proceedings of the Biennial Meeting of the Philosophy of Science Association 1980:512 - 531.
Categorical Quantification.Constantin C. Brîncuș - forthcoming - Bulletin of Symbolic Logic:1-27.
Categoricity by convention.Julien Murzi & Brett Topey - 2021 - Philosophical Studies 178 (10):3391-3420.
Comparing Peano arithmetic, Basic Law V, and Hume’s Principle.Sean Walsh - 2012 - Annals of Pure and Applied Logic 163 (11):1679-1709.
Minimal truth and interpretability.Martin Fischer - 2009 - Review of Symbolic Logic 2 (4):799-815.
String theory.John Corcoran, William Frank & Michael Maloney - 1974 - Journal of Symbolic Logic 39 (4):625-637.

Analytics

Added to PP
2017-01-09

Downloads
1,404 (#8,521)

6 months
369 (#6,143)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

On what there is.W. V. Quine - 1953 - In Willard Van Orman Quine (ed.), From a Logical Point of View. Cambridge: Harvard University Press. pp. 1-19.
On What There Is.Willard Van Orman Quine - 1948 - Review of Metaphysics 2 (5):21-38.
Informal Rigour and Completeness Proofs.Georg Kreisel - 1967 - In Imre Lakatos (ed.), Problems in the philosophy of mathematics. Amsterdam,: North-Holland Pub. Co.. pp. 138--157.
How we learn mathematical language.Vann McGee - 1997 - Philosophical Review 106 (1):35-68.
How We Learn Mathematical Language.Vann McGee - 1997 - Philosophical Review 106 (1):35-68.

View all 6 references / Add more references