Journal of Symbolic Logic 47 (2):403-415 (1982)
Let P 0 be the subsystem of Peano arithmetic obtained by restricting induction to bounded quantifier formulas. Let M be a countable, nonstandard model of P 0 whose domain we suppose to be the standard integers. Let T be a recursively enumerable extension of Peano arithmetic all of whose existential consequences are satisfied in the standard model. Then there is an initial segment M ' of M which is a model of T such that the complete diagram of M ' is Turing reducible to the atomic diagram of M. Moreover, neither the addition nor the multiplication of M is recursive
|Keywords||No keywords specified (fix it)|
|Categories||categorize this paper)|
References found in this work BETA
No references found.
Citations of this work BETA
Every Countable Model of Set Theory Embeds Into its Own Constructible Universe.Joel David Hamkins - 2013 - Journal of Mathematical Logic 13 (2):1350006.
On Gödel Incompleteness and Finite Combinatorics.Akihiro Kanamori & Kenneth McAloon - 1987 - Annals of Pure and Applied Logic 33 (1):23-41.
A Sharpened Version of McAloon's Theorem on Initial Segments of Models of< I> IΔ_< Sub> 0.Paola D'Aquino - 1993 - Annals of Pure and Applied Logic 61 (1):49-62.
A Sharpened Version of McAloon's Theorem on Initial Segments of Models of IΔ0.Paola D'Aquino - 1993 - Annals of Pure and Applied Logic 61 (1-2):49-62.
Similar books and articles
Some Remarks on Initial Segments in Models of Peano Arithmetic.Henryk Kotlarski - 1984 - Journal of Symbolic Logic 49 (3):955-960.
Models Without Indiscernibles.Fred G. Abramson & Leo A. Harrington - 1978 - Journal of Symbolic Logic 43 (3):572-600.
Model-Theoretic Properties Characterizing Peano Arithmetic.Richard Kaye - 1991 - Journal of Symbolic Logic 56 (3):949-963.
Regularity in Models of Arithmetic.George Mills & Jeff Paris - 1984 - Journal of Symbolic Logic 49 (1):272-280.
The Strength of Nonstandard Methods in Arithmetic.C. Ward Henson, Matt Kaufmann & H. Jerome Keisler - 1984 - Journal of Symbolic Logic 49 (4):1039-1058.
A Model of Peano Arithmetic with No Elementary End Extension.George Mills - 1978 - Journal of Symbolic Logic 43 (3):563-567.
On Certain Types and Models for Arithmetic.Andreas Blass - 1974 - Journal of Symbolic Logic 39 (1):151-162.
Theories of Arithmetics in Finite Models.M. Krynicki & K. Zdanowski - 2005 - Journal of Symbolic Logic 70 (1):1-28.
The Complexity of Classification Problems for Models of Arithmetic.Samuel Coskey & Roman Kossak - 2010 - Bulletin of Symbolic Logic 16 (3):345-358.
Added to index2009-01-28
Total downloads19 ( #261,540 of 2,177,988 )
Recent downloads (6 months)1 ( #317,698 of 2,177,988 )
How can I increase my downloads?