Nonstandard definability

Annals of Pure and Applied Logic 42 (1):21-43 (1989)
  Copy   BIBTEX

Abstract

We investigate the notion of definability with respect to a full satisfaction class σ for a model M of Peano arithmetic. It is shown that the σ-definable subsets of M always include a class which provides a satisfaction definition for standard formulas. Such a class is necessarily proper, therefore there exist recursively saturated models with no full satisfaction classes. Nonstandard extensions of overspill and recursive saturation are utilized in developing a criterion for nonstandard definability. Finally, these techniques yield some information concerning the extendibility of full satisfaction classes from one model to another

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 76,391

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

A definable nonstandard enlargement.Frederik Herzberg - 2008 - Mathematical Logic Quarterly 54 (2):167-175.
Addendum to “A definable nonstandard enlargement”.Frederik Herzberg - 2008 - Mathematical Logic Quarterly 54 (6):666-667.
Definability of Initial Segments.Akito Tsuboi & Saharon Shelah - 2002 - Notre Dame Journal of Formal Logic 43 (2):65-73.
Nonstandard set theory.Peter Fletcher - 1989 - Journal of Symbolic Logic 54 (3):1000-1008.
On definability in multimodal logic.Joseph Y. Halpern, Dov Samet & Ella Segev - 2009 - Review of Symbolic Logic 2 (3):451-468.
A Nonstandard Delta Function in a Predicative Theory.Peter Zahn - 1995 - Mathematical Logic Quarterly 41 (2):257-260.
Nonstandard natural number systems and nonstandard models.Shizuo Kamo - 1981 - Journal of Symbolic Logic 46 (2):365-376.
Pseudo-Superstructures as Nonstandard Universes.Mauro Di Nasso - 1998 - Journal of Symbolic Logic 63 (1):222 - 236.
Standard sets in nonstandard set theory.Petr Andreev & Karel Hrbacek - 2004 - Journal of Symbolic Logic 69 (1):165-182.

Analytics

Added to PP
2014-01-16

Downloads
20 (#565,948)

6 months
1 (#451,971)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Disjunctions with stopping conditions.Roman Kossak & Bartosz Wcisło - 2021 - Bulletin of Symbolic Logic 27 (3):231-253.
Models of weak theories of truth.Mateusz Łełyk & Bartosz Wcisło - 2017 - Archive for Mathematical Logic 56 (5-6):453-474.
Condensable models of set theory.Ali Enayat - 2022 - Archive for Mathematical Logic 61 (3):299-315.

View all 10 citations / Add more citations