- 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
Definability of Initial Segments
Notre Dame Journal of Formal Logic 43 (2):65-73 (2002)
Abstract
In any nonstandard model of Peano arithmetic, the standard part is not first-order definable. But we show that in some model the standard part is definable as the unique solution of a formula , where P is a unary predicate variableDOI
10.1305/ndjfl/1071509428
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
Local initial segments of the Turing degrees.Bjørn Kjos-Hanssen - 2003 - Bulletin of Symbolic Logic 9 (1):26-36.
Definability and initial segments of c-degrees.Robert S. Lubarsky - 1988 - Journal of Symbolic Logic 53 (4):1070-1081.
A recursion principle for linear orderings.Juha Oikkonen - 1992 - Journal of Symbolic Logic 57 (1):82-96.
On initial segments of hyperdegrees.S. K. Thomason - 1970 - Journal of Symbolic Logic 35 (2):189-197.
A theorem on initial segments of degrees.S. K. Thomason - 1970 - Journal of Symbolic Logic 35 (1):41-45.
Implicit Definability of Subfields.Akito Tsuboi & Kenji Fukuzaki - 2003 - Notre Dame Journal of Formal Logic 44 (4):217-225.
Countable initial segments of the degrees of unsolvability.A. H. Lachlan & R. Lebeuf - 1976 - Journal of Symbolic Logic 41 (2):289-300.
Initial segments of the lattice of ideals of R.e. Degrees.Frank P. Weber - 1994 - Journal of Symbolic Logic 59 (4):1326-1350.
Some nondistributive lattices as initial segments of the degrees of unsolvability.Manuel Lerman - 1969 - Journal of Symbolic Logic 34 (1):85-98.
Undecidability and initial segments of the (r.E.) TT-Degrees.Christine Ann Haught & Richard A. Shore - 1990 - Journal of Symbolic Logic 55 (3):987-1006.
Lattice initial segments of the hyperdegrees.Richard A. Shore & Bjørn Kjos-Hanssen - 2010 - Journal of Symbolic Logic 75 (1):103-130.
Initial segments of the degrees of unsolvability part II: Minimal degrees.C. E. M. Yates - 1970 - Journal of Symbolic Logic 35 (2):243-266.
Initial segments of ▵12n + 1-degrees.Ilias G. Kastanas - 1988 - Journal of Symbolic Logic 53 (1):259 - 268.
Analytics
Added to PP
2010-08-24
Downloads
23 (#507,708)
6 months
1 (#482,368)
2010-08-24
Downloads
23 (#507,708)
6 months
1 (#482,368)
Historical graph of downloads
Citations of this work
Implicit Definability of Subfields.Akito Tsuboi & Kenji Fukuzaki - 2003 - Notre Dame Journal of Formal Logic 44 (4):217-225.
References found in this work
Models with second order properties IV. A general method and eliminating diamonds.Saharon Shelah - 1983 - Annals of Pure and Applied Logic 25 (2):183-212.
Remarks on weak notions of saturation in models of peano arithmetic.Matt Kaufmann & James H. Schmerl - 1987 - Journal of Symbolic Logic 52 (1):129-148.
Models with second order properties II. Trees with no undefined branches.Saharon Shelah - 1978 - Annals of Mathematical Logic 14 (1):73.
Some highly saturated models of Peano arithmetic.James H. Schmerl - 2002 - Journal of Symbolic Logic 67 (4):1265-1273.
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-5c86f9596c-lp6tz N