𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The Recursively Saturated Part of Models of Peano Arithmetic

✍ Scribed by Henryk Kotlarski


Publisher
John Wiley and Sons
Year
1986
Tongue
English
Weight
403 KB
Volume
32
Category
Article
ISSN
0044-3050

No coin nor oath required. For personal study only.

✦ Synopsis


PA we define the rfcursively saturated part of XU by RS(9Jl) = ( a E $1: ( 3 8 < YJ?) ( a E )%I and 8 is recursively saturated)).

We shall study various possibilities for the relationship between 912 and RS(XU). Tliii paper has grown out of our observation that it may happen that , D is a simple extension (of the minimal model of Th?n) and has a non-empty recursively saturated part: this is implicit in SMORY~SKI-STAVI [6] and KOTLARSKI [3]. Several ideas used in this paper are taken from SMORY~SKI-STAVI [6] and KOTLARSKI [4].

Our first observation is the following T h e o r e m 1. For any XU 1 PA, RS( 93) is either empty 0 1 it i s an elementary initial segmrd of 9Jl.

Proof. Suppose that a , , . . ., a, E 1ER1. We may assume that a , < . . . < a,. Pick Y2, < W, i = 1, . . . . n, such that a, E and %, is recursively saturated. Extend Y?, , to 9i, = [b E 19Rl: ( 3 c E I%,l) b 5 c} By GAIFMAN [l, proposition 2.21, 8, <En. By SMORT~SKI-STAVI [6], 8, is recursively saturated. It follows that if t(v,, . . . . a,) is any trrm of the language of PA then t(a,,

, a,) E 1!JlnJ, therefore RS(YJ?) is an elementary submodel of XU (as it is closed under Skolem functions). Moreover, if h 5 c, then c E RS(93), and exactly the same argument gives that b E RS(CrR).


πŸ“œ SIMILAR VOLUMES


Relatively Recursively Enumerable Versus
✍ Grzegorz Michalski πŸ“‚ Article πŸ“… 1995 πŸ› John Wiley and Sons 🌐 English βš– 416 KB

## Abstract We show that that every countable model of __PA__ has a conservative extension __M__ with a subset __Y__ such that a certain Ξ£~1~(__Y__)‐formula defines in __M__ a subset which is not r. e. relative to __Y__.

Nonstandard models that are definable in
✍ Kazuma Ikeda; Akito Tsuboi πŸ“‚ Article πŸ“… 2007 πŸ› John Wiley and Sons 🌐 English βš– 183 KB

## Abstract In this paper, we investigate definable models of Peano Arithmetic PA in a model of PA. For any definable model __N__ without parameters in a model __M__, we show that __N__ is isomorphic to __M__ if __M__ is elementary extension of the standard model and __N__ is elementarily equivalen

Expanding the additive reduct of a model
✍ Masahiko Murakami; Akito Tsuboi πŸ“‚ Article πŸ“… 2003 πŸ› John Wiley and Sons 🌐 English βš– 124 KB πŸ‘ 2 views

## Abstract Let __M__ be a model of first order Peano arithmetic (**PA**) and __I__ an initial segment of __M__ that is closed under multiplication. Let__M__~0~ be the {0, 1,+}‐reduct of__M__. We show that there is another model __N__ of **PA** that is also an expansion of __M__~0~ such that __a__

Interstitial and pseudo gaps in models o
✍ Ermek S. Nurkhaidarov πŸ“‚ Article πŸ“… 2010 πŸ› John Wiley and Sons 🌐 English βš– 111 KB πŸ‘ 1 views

In this paper we study the automorphism groups of models of Peano Arithmetic. Kossak, Kotlarski, and Schmerl [9] shows that the stabilizer of an unbounded element a of a countable recursively saturated model of Peano Arithmetic M is a maximal subgroup of Aut(M ) if and only if the type of a is selec

Substructure lattices and almost minimal
✍ James H. Schmerl πŸ“‚ Article πŸ“… 2004 πŸ› John Wiley and Sons 🌐 English βš– 141 KB πŸ‘ 1 views

## Abstract This paper concerns intermediate structure lattices Lt(𝒩/ℳ︁), where 𝒩 is an almost minimal elementary end extension of the model ℳ︁ of Peano Arithmetic. For the purposes of this abstract only, let us say that ℳ︁ attains __L__ if __L__ β‰… Lt(𝒩/ℳ︁) for some almost minimal elementary end ex