On interpretations of arithmetic and set theory
It is ``folklore knowledge that PA (Peano Arithmetic) and ZF-inf (Zermelo-Fraenkel set theory with the axiom of infinity negated) are mutually interpretable. Codes of bounded definable sets in a model of PA serve as a universe of a model of ZF-inf. Ordinals in a model of ZF-inf form a model of PA. However, as the authors say in the conclusions of the paper, ``[...] for the finer result with interpretations inverse to each other, careful axiomatization of the set theory is required. The main result is an interpretation of PA in finite set theory in which the domain of the interpretation is the whole set-theoretic universe. To achieve this, ZF-inf is replaced by ZF-inf plus the axiom declaring that every set is contained in a transitively closed set. The paper concludes with hierarchical variants of interpretations for fragments of PA and ZF and a discussion of difficulties and potential applications of similar results to weak fragments of arithmetic in which totality of the exponential function if not provable.
- On interpretations of bounded arithmetic and bounded set theory
- Interpretability of various extensions of arithmetic
- Models of arithmetic and categories with finiteness conditions
- Arithmetical set theory
- On positive local combinatorial dividing-lines in model theory
- On the virtue of categoricity
- Constructive Ackermann's interpretation
- Some upper bounds on ordinal-valued Ramsey numbers for colourings of pairs
- Bases for structures and theories. I.
- Cichoń's maximum
- Towards a generic view of primality through multiset decompositions of natural numbers
- Set theory with and without urelements and categories of interpretations
- A few more dissimilarities between second-order arithmetic and set theory
- Substandard models of finite set theory
- Emulating primality with multiset representations of natural numbers
- -models of finite set theory
- scientific article; zbMATH DE number 4172966 (Why is no real title available?)
- Fragments of Kripke-Platek set theory and the metamathematics of -recursion theory
- A Groupoid of Isomorphic Data Transformations
- Amphi-ZF : axioms for Conway games
- scientific article; zbMATH DE number 1263906 (Why is no real title available?)
- An Effective Conservation Result for Nonstandard Arithmetic
- INITIAL SELF-EMBEDDINGS OF MODELS OF SET THEORY
- LEVEL THEORY, PART 3: A BOOLEAN ALGEBRA OF SETS ARRANGED IN WELL-ORDERED LEVELS
- On the concept of finitism
- On Morita equivalence and interpretability
- Indivisible sets and well-founded orientations of the Rado graph
- INCOMPLETENESS VIA PARADOX AND COMPLETENESS
- Equivalences for truth predicates
- Every countable model of set theory embeds into its own constructible universe
- scientific article; zbMATH DE number 3051339 (Why is no real title available?)
- Bounded finite set theory
- SZEMERÉDI’S THEOREM: AN EXPLORATION OF IMPURITY, EXPLANATION, AND CONTENT
- Truth in generic cuts
- The strength of extensionality. II: Weak weak set theories without infinity
- Ontological purity for formal proofs
- Indiscernibles and satisfaction classes in arithmetic
- Gaps, gluts, and theoretical equivalence
- When bi-interpretability implies synonymy
- Broad infinity and generation principles
- Intuitionistic sets and numbers: small set theory and Heyting arithmetic
- On logical and scientific strength
- Informative gluing and collapsing of pre-orders
This page was built for publication: On interpretations of arithmetic and set theory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2425351)
