论文信息 - Saturation and simple extensions of models of peano arithmetic - 字舞流文

Saturation and simple extensions of models of peano arithmetic

On caracterise parmi des modeles denombrables de PA ceux qui ont des extensions simples recursivement saturees: ce sont les modeles eleves. C'est ce concept de modele eleve que l'on etudie en details

James H. Schmerl | Matt Kaufmann | Matt Kaufmann | J. Schmerl

[1] H. Jerome Keisler,et al. Ultraproducts and Saturated Models , 1964 .

[2] Jean-François Pabion. Saturated Models of Peano Arithmetic , 1982, J. Symb. Log..

[3] C. Smorynski,et al. Cofinal extension preserves recursive saturation , 1980 .

[4] James H. Schmerl. Recursively saturated, rather classless models of peano arithmetic , 1981 .

[5] Matt Kaufmann,et al. A rather classless model , 1977 .

[6] Henryk Kotlarski. On Cofinal Extensions of Models of Arithmetic , 1983, J. Symb. Log..

[7] Saharon Shelah,et al. Models with second order properties II. Trees with no undefined branches , 1978 .

[8] Jeff B. Paris,et al. Closure properties of countable non-standard integers , 1979 .

[9] Kenneth Kunen,et al. Ultrafilters and independent sets , 1972 .

[10] Jon Barwise,et al. On recursively saturated models of arithmetic , 1975 .

[11] H. Jerome Keisler,et al. Ultraproducts which are not Saturated , 1967, J. Symb. Log..

[12] Leszek Pacholski,et al. Model theory of algebra and arithmetic , 1980 .

[13] H. Keisler,et al. Handbook of mathematical logic , 1977 .

[14] J. Paris. A Mathematical Incompleteness in Peano Arithmetic , 1977 .