Hostname: page-component-7b7567c8c-m6dxt Total loading time: 0 Render date: 2026-11-18T23:53:06.518Z Has data issue: false hasContentIssue false

Nonstandard characterizations of recursive saturation and resplendency

Published online by Cambridge University Press:  12 March 2014

Stuart T. Smith*
Affiliation:
Department of Mathematics and Statistics, Simon Fraser University, Burnaby, British Columbia V5A 1S6, CanadaDepartment of Mathematics and Computer Science, Ben-Gurion University of the Negev, Beersheva, Israel

Abstract

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 of PA is recursively saturated iff is nonstandard and -logic is consistent. is resplendent iff is nonstandard, -logic is consistent, and every sentence φ which is consistent in -logic is contained in a full satisfaction class for . Thus, for models of PA, recursive saturation can be expressed by a (standard) -sentence and resplendency by a -sentence.

Information

Type
Research Article
Copyright
Copyright © Association for Symbolic Logic 1987

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable