On Interpretations of Arithmetic and Set Theory

Notre Dame Journal of Formal Logic 48 (4):497-510 (2007)
  Copy   BIBTEX

Abstract

This paper starts by investigating Ackermann's interpretation of finite set theory in the natural numbers. We give a formal version of this interpretation from Peano arithmetic (PA) to Zermelo-Fraenkel set theory with the infinity axiom negated (ZF−inf) and provide an inverse interpretation going the other way. In particular, we emphasize the precise axiomatization of our set theory that is required and point out the necessity of the axiom of transitive containment or (equivalently) the axiom scheme of ∈-induction. This clarifies the nature of the equivalence of PA and ZF−inf and corrects some errors in the literature. We also survey the restrictions of the Ackermann interpretation and its inverse to subsystems of PA and ZF−inf, where full induction, replacement, or separation is not assumed. The paper concludes with a discussion on the problems one faces when the totality of exponentiation fails, or when the existence of unordered pairs or power sets is not guaranteed

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,202

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

On interpretations of bounded arithmetic and bounded set theory.Richard Pettigrew - 2009 - Notre Dame Journal of Formal Logic 50 (2):141-152.
Arithmetical set theory.Paul Strauss - 1991 - Studia Logica 50 (2):343 - 350.
Consequences of arithmetic for set theory.Lorenz Halbeisen & Saharon Shelah - 1994 - Journal of Symbolic Logic 59 (1):30-40.
Kant’s Theory of Arithmetic: A Constructive Approach? [REVIEW]Kristina Engelhard & Peter Mittelstaedt - 2008 - Journal for General Philosophy of Science / Zeitschrift für Allgemeine Wissenschaftstheorie 39 (2):245 - 271.
Notes on logic and set theory.P. T. Johnstone - 1987 - New York: Cambridge University Press.
On the derivability of instantiation properties.Harvey Friedman - 1977 - Journal of Symbolic Logic 42 (4):506-514.

Analytics

Added to PP
2010-08-24

Downloads
63 (#246,899)

6 months
13 (#165,103)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Incompleteness Via Paradox and Completeness.Walter Dean - 2020 - Review of Symbolic Logic 13 (3):541-592.
On Morita equivalence and interpretability.Paul Anh Mceldowney - 2020 - Review of Symbolic Logic 13 (2):388-415.
Finitary Set Theory.Laurence Kirby - 2009 - Notre Dame Journal of Formal Logic 50 (3):227-244.

View all 28 citations / Add more citations