Saturation and simple extensions of models of peano arithmetic

&
Annals of Pure and Applied Logic 27 (2):109-136 (1984)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1016/0168-0072(84)90008-3

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 101,505

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

James H. Schmerl. Peano models with many generic classes. Pacific Journal of Mathematics, vol. 43 (1973), pp. 523–536. - James H. Schmerl. Correction to: “Peano models with many generic classes”. Pacific Journal of Mathematics, vol. 92 (1981), no. 1, pp. 195–198. - James H. Schmerl. Recursively saturated, rather classless models of Peano arithmetic. Logic Year 1979–80. Recursively saturated, rather classless models of Peano arithmetic. Logic Year 1979–80 (Proceedings, Seminars, and Conferences in Mathematical Logic, University of Connecticut, Storrs, Connecticut, 1979/80). edited by M. Lerman, J. H. Schmerl, and R. I. Soare, Lecture Notes in Mathematics, vol. 859. Springer, Berlin, pp. 268–282. - James H. Schmerl. Recursively saturatedmodels generated by indiscernibles. Notre Dane Journal of Formal Logic, vol. 26 (1985), no. 1, pp. 99–105. - James H. Schmerl. Large resplendent models generated by indiscernibles. The Journal of Symbolic Logic, vol. 54 (1989), no. 4, pp. 1382–1388. - Jam. [REVIEW]Roman Kossak - 2009 - Bulletin of Symbolic Logic 15 (2):222-227.
Schmerl decompositions in first order arithmetic.François Dorais, Zachary Evans, Marcia Groszek, Seth Harris & Theodore Slaman - 2019 - Annals of Pure and Applied Logic 170 (12):102717.
Peano arithmetic, games and descent recursion.Emanuele Frittaion - 2025 - Annals of Pure and Applied Logic 176 (4):103550.
On the programs-as-formulas interpretation of parallel programs in peano arithmetic.E. J. Farkas & M. E. Szabo - 1988 - Annals of Pure and Applied Logic 37 (2):111-127.
Fixed points in Peano arithmetic with ordinals.Gerhard Jäger - 1993 - Annals of Pure and Applied Logic 60 (2):119-132.
Realizability for Peano arithmetic with winning conditions in HON games.Valentin Blot - 2017 - Annals of Pure and Applied Logic 168 (2):254-277.
Admissible extensions of subtheories of second order arithmetic.Gerhard Jäger & Michael Rathjen - 2024 - Annals of Pure and Applied Logic 175 (7):103425.
Nonstandard definability.Stuart T. Smith - 1989 - Annals of Pure and Applied Logic 42 (1):21-43.
Richard Sommer. Transfinite induction within Peano arithmetic. Annals of pure and applied logic, vol. 76 , pp. 231–289.Michael Rathjen - 1996 - Journal of Symbolic Logic 61 (4):1388.
End extensions of models of linearly bounded arithmetic.Domenico Zambella - 1997 - Annals of Pure and Applied Logic 88 (2-3):263-277.

Analytics

Added to PP
2014-01-16

Downloads
57 (#378,204)

6 months
4 (#1,255,690)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Nonstandard definability.Stuart T. Smith - 1989 - Annals of Pure and Applied Logic 42 (1):21-43.
Set theoretical analogues of the Barwise-Schlipf theorem.Ali Enayat - 2022 - Annals of Pure and Applied Logic 173 (9):103158.
Models with the ω-property.Roman Kossak - 1989 - Journal of Symbolic Logic 54 (1):177-189.
Meager sets on the hyperfinite time line.H. Jerome Keisler & Steven C. Leth - 1991 - Journal of Symbolic Logic 56 (1):71-102.

View all 7 citations / Add more citations

References found in this work

A mathematical incompleteness in Peano arithmetic.Jeff Paris & Leo Harrington - 1977 - In Jon Barwise (ed.), Handbook of mathematical logic. New York: North-Holland. pp. 90--1133.
Ultraproducts which are not saturated.H. Jerome Keisler - 1967 - Journal of Symbolic Logic 32 (1):23-46.
Ultraproducts and Saturated Models.H. Jerome Keisler - 1970 - Journal of Symbolic Logic 35 (4):584-585.
Saturated models of peano arithmetic.J. F. Pabion - 1982 - Journal of Symbolic Logic 47 (3):625-637.

View all 7 references / Add more references