Transplendent Models: Expansions Omitting a Type

Notre Dame Journal of Formal Logic 53 (3):413-428 (2012)
Abstract
We expand the notion of resplendency to theories of the kind T + p", where T is a fi rst-order theory and p" expresses that the type p is omitted. We investigate two di erent formulations and prove necessary and sucient conditions for countable recursively saturated models of PA. Some of the results in this paper can be found in one of the author's doctoral thesis [3].
Keywords models of arithmetic   resplendent models   standard cut   satisfaction classes
Categories (categorize this paper)
DOI 10.1215/00294527-1716739
Options
 Save to my reading list
Follow the author(s)
Edit this record
My bibliography
Export citation
Find it on Scholar
Mark as duplicate
Request removal from index
Revision history
Download options
Our Archive


Upload a copy of this paper     Check publisher's policy     Papers currently archived: 29,848
Through your library
References found in this work BETA

No references found.

Add more references

Citations of this work BETA

No citations found.

Add more citations

Similar books and articles
Four Problems Concerning Recursively Saturated Models of Arithmetic.Roman Kossak - 1995 - Notre Dame Journal of Formal Logic 36 (4):519-530.
The Spectrum of Resplendency.John T. Baldwin - 1990 - Journal of Symbolic Logic 55 (2):626-636.
Theories of Arithmetics in Finite Models.M. Krynicki & K. Zdanowski - 2005 - Journal of Symbolic Logic 70 (1):1-28.
Models with the Ω-Property.Roman Kossak - 1989 - Journal of Symbolic Logic 54 (1):177-189.
Generic Expansions of Countable Models.Silvia Barbina & Domenico Zambella - 2012 - Notre Dame Journal of Formal Logic 53 (4):511-523.
Theories with a Finite Number of Countable Models.Robert E. Woodrow - 1978 - Journal of Symbolic Logic 43 (3):442-455.
Added to PP index
2012-03-17

Total downloads
61 ( #93,416 of 2,210,502 )

Recent downloads (6 months)
1 ( #387,753 of 2,210,502 )

How can I increase my downloads?

Monthly downloads
My notes
Sign in to use this feature