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 first-order theory and p↑ expresses that the type p is omitted; both T and p are in languages extending the base language. We investigate two different formulations and prove necessary and sufficient conditions for countable recursively saturated models of PA. | |||||||||
| Keywords | models of arithmetic resplendent models standard cut satisfaction classes | |||||||||
| Categories | ||||||||||
| Options |
|
|||||||||
Download options| PhilPapers Archive |
Upload a copy of this paper Check publisher's policy on self-archival Papers currently archived: 5,705 |
| External links |
  Try with proxy. Try with proxy. Try with proxy. |
| Through your library | Configure |
Similar books and articlesFredrik Engström & Richard W. Kaye (2012). Transplendent Models: Expansions Omitting a Type. Notre Dame Journal of Formal Logic 53 (3):413-428.
Fredrik Engström & Richard W. Kaye (2012). Transplendent Models: Expansions Omitting a Type. Notre Dame Journal of Formal Logic 53 (3):413-428.
Fredrik Engström (2004). Expansions, Omitting Types, and Standard Systems. Dissertation, Chalmers
Roman Kossak (1995). Four Problems Concerning Recursively Saturated Models of Arithmetic. Notre Dame Journal of Formal Logic 36 (4):519-530.
John T. Baldwin (1990). The Spectrum of Resplendency. Journal of Symbolic Logic 55 (2):626-636.
Samuel Coskey & Roman Kossak (2010). The Complexity of Classification Problems for Models of Arithmetic. Bulletin of Symbolic Logic 16 (3):345-358.
Ermek S. Nurkhaidarov & Erez Shochat (2010). Automorphisms of Saturated and Boundedly Saturated Models of Arithmetic. Notre Dame Journal of Formal Logic 52 (3):315-329.
Stuart T. Smith (1987). Nonstandard Characterizations of Recursive Saturation and Resplendency. Journal of Symbolic Logic 52 (3):842-863.
M. Krynicki & K. Zdanowski (2005). Theories of Arithmetics in Finite Models. Journal of Symbolic Logic 70 (1):1-28.
Roman Kossak (1989). Models with the Ω-Property. Journal of Symbolic Logic 54 (1):177-189.
Arthur Fine (1982). Some Local Models for Correlation Experiments. Synthese 50 (2):279 - 294.
Silvia Barbina & Domenico Zambella (2012). Generic Expansions of Countable Models. Notre Dame Journal of Formal Logic 53 (4):511-523.
Robert E. Woodrow (1978). Theories with a Finite Number of Countable Models. Journal of Symbolic Logic 43 (3):442-455.
Vladimir Kanovei & Michael Reeken (2000). Extending Standard Models of ZFC to Models of Nonstandard Set Theories. Studia Logica 64 (1):37-59.
Cezary Cieśliński (2010). Deflationary Truth and Pathologies. Journal of Philosophical Logic 39 (3).
Analytics
Monthly downloads
Sorry, there are not enough data points to plot this chart.
|
Added to index2012-10-01Total downloads0Recent downloads (6 months)0How can I increase my downloads? |
My notes
Discussion
