Nonstandard characterizations of recursive saturation and resplendency

Journal of Symbolic Logic 52 (3):842-863 (1987)
  Copy   BIBTEX


We prove results about nonstandard formulas in models of Peano arithmetic which complement those of Kotlarski, Krajewski, and Lachlan in [KKL] and [L]. This enables us to characterize both recursive saturation and resplendency in terms of statements about nonstandard sentences. Specifically, a model M of PA is recursively saturated iff M is nonstandard and M-logic is consistent.M is resplendent iff M is nonstandard, M-logic is consistent, and every sentence φ which is consistent in M-logic is contained in a full satisfaction class for M. Thus, for models of PA, recursive saturation can be expressed by a (standard) Σ 1 1 -sentence and resplendency by a ▵ 1 2 -sentence



    Upload a copy of this work     Papers currently archived: 91,386

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles


Added to PP

62 (#254,871)

6 months
7 (#411,886)

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.
Truth, Pretense and the Liar Paradox.Bradley Armour-Garb & James A. Woodbridge - 2015 - In T. Achourioti, H. Galinon, J. Martínez Fernández & K. Fujimoto (eds.), Unifying the Philosophy of Truth. Dordrecht: Imprint: Springer. pp. 339-354.

Add more citations

References found in this work

Factorization of polynomials and °1 induction.S. G. Simpson - 1986 - Annals of Pure and Applied Logic 31:289.

Add more references