The property “arithmetic-is-recursive” on a cone

, &
Journal of Mathematical Logic 21 (3) (2021)
  Copy   BIBTEX

Abstract

We say that a theory T satisfies arithmetic-is-recursive if any X′-computable model of T has an X-computable copy; that is, the models of T satisfy a sort of jump inversion. We give an example of a...

Categories

Keywords

Reprint years

DOI

10.1142/s0219061321500215

Links

PhilArchive



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

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

The property “arithmetic-is-recursive” on a cone.Uri Andrews, Matthew Harrison-Trainor & Noah Schweber - 2021 - Journal of Mathematical Logic 21 (3):2150021.
Weak theories of nonstandard arithmetic and analysis.Jeremy Avigad - manuscript
A Completeness Theorem for Certain Classes of Recursive Infinitary Formulas.Christopher J. Ash & Julia F. Knight - 1994 - Mathematical Logic Quarterly 40 (2):173-181.
On the Difficulty of Writing Out formal Proofs in Arithmetic.Ryo Kashima & Takeshi Yamaguchi - 1997 - Mathematical Logic Quarterly 43 (3):328-332.
Tennenbaum's Theorem and Unary Functions.Sakae Yaegasi - 2008 - Notre Dame Journal of Formal Logic 49 (2):177-183.
Iterability for (transfinite) stacks.Farmer Schlutzenberg - 2021 - Journal of Mathematical Logic 21 (2):2150008.
Minimal realizability of intuitionistic arithmetic and elementary analysis.Zlatan Damnjanovic - 1995 - Journal of Symbolic Logic 60 (4):1208-1241.
On a Theory for AC0 and the Strength of the Induction Scheme.Satoru Kuroda - 1998 - Mathematical Logic Quarterly 44 (3):417-426.
Polynomially Bounded Recursive Realizability.Saeed Salehi - 2005 - Notre Dame Journal of Formal Logic 46 (4):407-417.
On predicate provability logics and binumerations of fragments of Peano arithmetic.Taishi Kurahashi - 2013 - Archive for Mathematical Logic 52 (7-8):871-880.
Computational Structuralism &dagger.Volker Halbach & Leon Horsten - 2005 - Philosophia Mathematica 13 (2):174-186.
Real closures of models of weak arithmetic.Emil Jeřábek & Leszek Aleksander Kołodziejczyk - 2013 - Archive for Mathematical Logic 52 (1-2):143-157.
Expansions, omitting types, and standard systems.Fredrik Engström - 2004 - Dissertation, Chalmers
Generic derivations on o-minimal structures.Antongiulio Fornasiero & Elliot Kaplan - 2020 - Journal of Mathematical Logic 21 (2):2150007.
On the set-theoretic strength of the existence of disjoint cofinal sets in posets without maximal elements.Paul Howard, Denis I. Saveliev & Eleftherios Tachtsis - 2016 - Mathematical Logic Quarterly 62 (3):155-176.

Analytics

Added to PP
2021-06-23

Downloads
9 (#1,187,161)

6 months
3 (#902,269)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

Stability of recursive structures in arithmetical degrees.C. J. Ash - 1986 - Annals of Pure and Applied Logic 32:113-135.
Labelling systems and R.E. structures.C. J. Ash - 1990 - Annals of Pure and Applied Logic 47 (2):99-119.
Measuring complexities of classes of structures.Barbara F. Csima & Carolyn Knoll - 2015 - Annals of Pure and Applied Logic 166 (12):1365-1381.

Add more references