Does set theory really ground arithmetic truth?

Abstract

We consider the foundational relation between arithmetic and set theory. Our goal is to criticize the construction of standard arithmetic models as providing grounds for arithmetic truth (even in a relative sense). Our method is to emphasize the incomplete picture of both theories and treat models as their syntactical counterparts. Insisting on the incomplete picture will allow us to argue in favor of the revisability of the standard model interpretation. We then show that it is hopeless to expect that the relative grounding provided by a standard interpretation can resist being revisable. We start briefly characterizing the expansion of arithmetic `truth' provided by the interpretation in a set theory. Further, we show that, for every well-founded interpretation of recursive extensions of PA in extensions of ZF, the interpreted version of arithmetic has more theorems than the original. This theorem expansion is not complete however. We continue by defining the coordination problem. The problem can be summarized as follows. We consider two independent communities of mathematicians responsible for deciding over new axioms for ZF and PA. How likely are they to be coordinated regarding PA’s interpretation in ZF? We prove that it is possible to have extensions of PA not interpretable in a given set theory ST. We further show that the probability of a random extension of arithmetic being interpretable in ST is zero.

Links

PhilArchive

External links

  • This entry has no external links. Add one.
Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

  • Only published works are available at libraries.

Similar books and articles

On interpretations of bounded arithmetic and bounded set theory.Richard Pettigrew - 2009 - Notre Dame Journal of Formal Logic 50 (2):141-152.
Minimal truth and interpretability.Martin Fischer - 2009 - Review of Symbolic Logic 2 (4):799-815.
Weak Theories of Concatenation and Arithmetic.Yoshihiro Horihata - 2012 - Notre Dame Journal of Formal Logic 53 (2):203-222.
An Effective Conservation Result for Nonstandard Arithmetic.Erik Palmgren - 2000 - Mathematical Logic Quarterly 46 (1):17-24.
On certain types and models for arithmetic.Andreas Blass - 1974 - Journal of Symbolic Logic 39 (1):151-162.
Arithmetic on semigroups.Mihai Ganea - 2009 - Journal of Symbolic Logic 74 (1):265-278.
Structures interpretable in models of bounded arithmetic.Neil Thapen - 2005 - Annals of Pure and Applied Logic 136 (3):247-266.

Analytics

Added to PP
2019-11-24

Downloads
75 (#222,463)

6 months
1 (#1,478,856)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Citations of this work

No citations found.

Add more citations

References found in this work

Mathematical Knowledge and the Interplay of Practices.José Ferreirós - 2015 - Princeton, USA: Princeton University Press.
On axiomatizability within a system.William Craig - 1953 - Journal of Symbolic Logic 18 (1):30-32.
Mathematical Knowledge and the Interplay of Practices.Jose Ferreiros - 2009 - In Mauricio Suárez, Mauro Dorato & Miklós Rédei (eds.), EPSA Philosophical Issues in the Sciences · Launch of the European Philosophy of Science Association. Dordrecht, Netherland: Springer. pp. 55--64.
Translating non Interpretable Theories.Alfredo Roque Freire - forthcoming - South America Journal of Logic.
On Existence in Set Theory, Part II: Relative Productivity.Rodrigo A. Freire - 2014 - Notre Dame Journal of Formal Logic 55 (1):91-105.

Add more references