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.

Analytics

Added to PP
2017-01-09

Downloads
688 (#21,136)

6 months
432 (#3,768)

Historical graph of downloads since first upload
This graph includes both downloads from PhilArchive and clicks on external links on PhilPapers.
How can I increase my downloads?