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

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
Keywords Peano arithmetic   finite set theory   interpretations
Categories (categorize this paper)
DOI 10.1305/ndjfl/1193667707
Options
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

PhilArchive copy


Upload a copy of this paper     Check publisher's policy     Papers currently archived: 63,274
Through your library

References found in this work BETA

On the Scheme of Induction for Bounded Arithmetic Formulas.A. J. Wilkie & J. B. Paris - 1987 - Annals of Pure and Applied Logic 35 (3):261-302.
Cuts, Consistency Statements and Interpretations.Pavel Pudlák - 1985 - Journal of Symbolic Logic 50 (2):423-441.
Addition and Multiplication of Sets.Laurence Kirby - 2007 - Mathematical Logic Quarterly 53 (1):52-65.

View all 14 references / Add more references

Citations of this work BETA

Incompleteness Via Paradox and Completeness.Walter Dean - 2020 - Review of Symbolic Logic 13 (3):541-592.
Finitary Set Theory.Laurence Kirby - 2009 - Notre Dame Journal of Formal Logic 50 (3):227-244.
Equivalences for Truth Predicates.Carlo Nicolai - 2017 - Review of Symbolic Logic 10 (2):322-356.
Bases for Structures and Theories I.Jeffrey Ketland - 2020 - Logica Universalis 14 (3):357-381.

View all 17 citations / Add more citations

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 - Cambridge University Press.
On the Derivability of Instantiation Properties.Harvey Friedman - 1977 - Journal of Symbolic Logic 42 (4):506-514.

Analytics

Added to PP index
2010-08-24

Total views
47 ( #227,003 of 2,448,677 )

Recent downloads (6 months)
2 ( #302,846 of 2,448,677 )

How can I increase my downloads?

Downloads

My notes