- 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
Four Problems Concerning Recursively Saturated Models of Arithmetic
Notre Dame Journal of Formal Logic 36 (4):519-530 (1995)
Abstract
The paper presents four open problems concerning recursively saturated models of Peano Arithmetic. One problems concerns a possible converse to Tarski's undefinability of truth theorem. The other concern elementary cuts in countable recursively saturated models, extending automorphisms of countable recursively saturated models, and Jonsson models of PA. Some partial answers are given.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
The complexity of classification problems for models of arithmetic.Samuel Coskey & Roman Kossak - 2010 - Bulletin of Symbolic Logic 16 (3):345-358.
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.
Elementary Cuts in Saturated Models of Peano Arithmetic.James H. Schmerl - 2012 - Notre Dame Journal of Formal Logic 53 (1):1-13.
Transplendent Models: Expansions Omitting a Type.Fredrik Engström & Richard W. Kaye - 2012 - Notre Dame Journal of Formal Logic 53 (3):413-428.
Nonstandard characterizations of recursive saturation and resplendency.Stuart T. Smith - 1987 - Journal of Symbolic Logic 52 (3):842-863.
Recursively saturated $\omega_1$-like models of arithmetic.Roman Kossak - 1985 - Notre Dame Journal of Formal Logic 26 (4):413-422.
On closed elementary cuts in recursively saturated models of Peano arithmetic.Bożena Piekart - 1993 - Notre Dame Journal of Formal Logic 34 (2):223-230.
On Cofinal Submodels and Elementary Interstices.Roman Kossak & James H. Schmerl - 2012 - Notre Dame Journal of Formal Logic 53 (3):267-287.
Recursively saturated nonstandard models of arithmetic.C. Smoryński - 1981 - Journal of Symbolic Logic 46 (2):259-286.
Elementary extensions of recursively saturated models of arithmetic.C. Smoryński - 1981 - Notre Dame Journal of Formal Logic 22 (3):193-203.
Automorphisms of Countable Recursively Saturated Models of PA: A Survey.Henryk Kotlarski - 1995 - Notre Dame Journal of Formal Logic 36 (4):505-518.
Automorphisms of Countable Short Recursively Saturated Models of PA.Erez Shochat - 2008 - Notre Dame Journal of Formal Logic 49 (4):345-360.
Analytics
Added to PP
2010-08-24
Downloads
33 (#483,942)
6 months
6 (#518,648)
2010-08-24
Downloads
33 (#483,942)
6 months
6 (#518,648)
Historical graph of downloads
Author's Profile
Citations of this work
On two questions concerning the automorphism groups of countable recursively saturated models of PA.Roman Kossak & Nicholas Bamber - 1996 - Archive for Mathematical Logic 36 (1):73-79.
Undefinability of truth and nonstandard models.Roman Kossak - 2004 - Annals of Pure and Applied Logic 126 (1-3):115-123.
Truth in generic cuts.Richard Kaye & Tin Lok Wong - 2010 - Annals of Pure and Applied Logic 161 (8):987-1005.
References found in this work
Models and types of Peano's arithmetic.Haim Gaifman - 1976 - Annals of Mathematical Logic 9 (3):223-306.
Automorphisms of recursively saturated models of arithmetic.Richard Kaye, Roman Kossak & Henryk Kotlarski - 1991 - Annals of Pure and Applied Logic 55 (1):67-99.
Recursively saturated nonstandard models of arithmetic.C. Smoryński - 1981 - Journal of Symbolic Logic 46 (2):259-286.
Initial Segments of Models of Peano's Axioms.L. A. S. Kirby, J. B. Paris, A. Lachlan, M. Srebrny & A. Zarach - 1983 - Journal of Symbolic Logic 48 (2):482-483.
On maximal subgroups of the automorphism group of a countable recursively saturated model of PA.Roman Kossak, Henryk Kotlarski & James H. Schmerl - 1993 - Annals of Pure and Applied Logic 65 (2):125-148.
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-64dd777598-vk9kt uwo