In [KP] we have studied the problem of determining when a subset of a (countable) model M of PA can be coded in an elementary end extension of M . Sets with this property are called elementary extensional . In particular we can ask whether there are elementary extensional subsets of a model which have order type ω . It turns out that having elementary extensional subsets of order type ω is an interesting property connected with other structural properties of models of PA. We will call this property the ω - property . In [KP] the problem of characterizing models with the ω -property was left open. It is still open, and the aim of this paper is to present a collection of results pertaining to it. It should be mentioned that the same notion was studied by Kaufmann and Schmerl in [KS2] in connection with some weak notions of saturation which they discuss there. Our notion of a model with the ω -property corresponds to the notion of an upward monotonically ω -lofty cut. It is fairly easy to see that countable recursively saturated models (or in fact all recursively saturated models with cofinality ω ) and all short recursively saturated models have the ω -property (Proposition 1.2 below). On the other hand, if we had asked the question about the existence of models with the ω -property before 1975 (when recursively saturated models were introduced) the answer would probably not have been that easy and we would have to come to notions close to recursive saturation.
[1]
C. Smorynski,et al.
Cofinal extension preserves recursive saturation
,
1980
.
[2]
James H. Schmerl,et al.
Saturation and simple extensions of models of peano arithmetic
,
1984,
Ann. Pure Appl. Log..
[3]
Henryk Kotlarski.
On elementary cuts in recursively saturated models of Peano Arithmetic
,
1984
.
[4]
Craig Smorynski.
Elementary extensions of recursively saturated models of arithmetic
,
1981,
Notre Dame J. Formal Log..
[5]
J. Paris,et al.
∑n-Collection Schemas in Arithmetic
,
1978
.
[6]
D. Kueker.
Back-and-forth arguments and infinitary logics
,
1975
.
[7]
Roman Kossak.
Recursively saturated ω1-like models of arithmetic
,
1985,
Notre Dame J. Formal Log..
[8]
Roman Kossak.
A note on satisfaction classes
,
1985,
Notre Dame J. Formal Log..
[9]
Craig Smorynski.
A note on initial segment constructions in recursively saturated models of arithmetic
,
1982,
Notre Dame J. Formal Log..
[10]
A. Ehrenfeucht,et al.
Some problem in elementary arithmetics
,
1976
.