- New
-
Topics
- All Categories
- Metaphysics and Epistemology
- Value Theory
- Science, Logic, and Mathematics
- Science, Logic, and Mathematics
- Logic and Philosophy of Logic
- Philosophy of Biology
- Philosophy of Cognitive Science
- Philosophy of Computing and Information
- Philosophy of Mathematics
- Philosophy of Physical Science
- Philosophy of Social Science
- Philosophy of Probability
- General Philosophy of Science
- Philosophy of Science, Misc
- History of Western Philosophy
- Philosophical Traditions
- Philosophy, Misc
- Other Academic Areas
- Journals
- Submit material
- More
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].Author's Profile
Links
PhilArchive
External links
(no proxy)
Setup an account with your affiliations in order to access resources via your University's proxy server
Through your library
- Sign in / register and customize your OpenURL resolver
- Configure custom resolver
My notes
Similar books and articles
Automorphisms of Countable Short Recursively Saturated Models of PA.Erez Shochat - 2008 - Notre Dame Journal of Formal Logic 49 (4):345-360.
Arithmetically Saturated Models of Arithmetic.Roman Kossak & James H. Schmerl - 1995 - Notre Dame Journal of Formal Logic 36 (4):531-546.
Automorphisms of Countable Recursively Saturated Models of PA: A Survey.Henryk Kotlarski - 1995 - Notre Dame Journal of Formal Logic 36 (4):505-518.
Four Problems Concerning Recursively Saturated Models of Arithmetic.Roman Kossak - 1995 - Notre Dame Journal of Formal Logic 36 (4):519-530.
Automorphisms of Saturated and Boundedly Saturated Models of Arithmetic.Ermek S. Nurkhaidarov & Erez Shochat - 2011 - Notre Dame Journal of Formal Logic 52 (3):315-329.
The complexity of classification problems for models of arithmetic.Samuel Coskey & Roman Kossak - 2010 - Bulletin of Symbolic Logic 16 (3):345-358.
A Galois correspondence for countable short recursively saturated models of PA.Erez Shochat - 2010 - Mathematical Logic Quarterly 56 (3):228-238.
Nonstandard characterizations of recursive saturation and resplendency.Stuart T. Smith - 1987 - Journal of Symbolic Logic 52 (3):842-863.
More Automorphism Groups of Countable, Arithmetically Saturated Models of Peano Arithmetic.James H. Schmerl - 2018 - Notre Dame Journal of Formal Logic 59 (4):491-496.
Analytics
Added to PP
2012-03-17
Downloads
41 (#112,661)
6 months
11 (#1,140,922)
2012-03-17
Downloads
41 (#112,661)
6 months
11 (#1,140,922)
Historical graph of downloads
Author's Profile
References found in this work
Automorphisms of recursively saturated models of arithmetic.Richard Kaye, Roman Kossak & Henryk Kotlarski - 1991 - Annals of Pure and Applied Logic 55 (1):67-99.
An introduction to recursively saturated and resplendent models.Jon Barwise & John Schlipf - 1976 - Journal of Symbolic Logic 41 (2):531-536.
Models with compactness properties relative to an admissible language.J. P. Ressayre - 1977 - Annals of Mathematical Logic 11 (1):31.
PhilPapers logo by Andrea Andrews and Meghan Driscoll.
This site uses cookies and Google Analytics (see our terms & conditions for details regarding the privacy implications). Use of this site is subject to terms & conditions.
All rights reserved by The PhilPapers Foundation
Server: philpapers-web-6686886f5-2nz2h uwo