- 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
A complicated ω-stable depth 2 theory
Journal of Symbolic Logic 76 (1):47 - 65 (2011)
Abstract
We present a countable complete first order theory T which is model theoretically very well behaved: it eliminates quantifiers, is ω-stable, it has NDOP and is shallow of depth two. On the other hand, there is no countable bound on the Scott heights of its countable models, which implies that the isomorphism relation for countable models is not BorelOther Versions
No versions found
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
Comparing Borel Reducibility and Depth of an ω-Stable Theory.Martin Koerwien - 2009 - Notre Dame Journal of Formal Logic 50 (4):365-380.
An Old Friend Revisited: Countable Models of ω-Stable Theories.Michael C. Laskowski - 2007 - Notre Dame Journal of Formal Logic 48 (1):133-141.
Most(?) Theories Have Borel Complete Reducts.Michael C. Laskowski & Douglas S. Ulrich - 2023 - Journal of Symbolic Logic 88 (1):418-426.
The Borel Complexity of Isomorphism for Theories with Many Types.David Marker - 2007 - Notre Dame Journal of Formal Logic 48 (1):93-97.
Analytic equivalence relations and bi-embeddability.Sy-David Friedman & Luca Motto Ros - 2011 - Journal of Symbolic Logic 76 (1):243 - 266.
The classification of countable models of set theory.John Clemens, Samuel Coskey & Samuel Dworetzky - 2020 - Mathematical Logic Quarterly 66 (2):182-189.
Borel equivalence relations and classifications of countable models.Greg Hjorth & Alexander S. Kechris - 1996 - Annals of Pure and Applied Logic 82 (3):221-272.
Classifiable theories without finitary invariants.E. Bouscaren & E. Hrushovski - 2006 - Annals of Pure and Applied Logic 142 (1-3):296-320.
Superstable theories with few countable models.Lee Fong Low & Anand Pillay - 1992 - Archive for Mathematical Logic 31 (6):457-465.
Borel equivalence relations induced by actions of the symmetric group.Greg Hjorth, Alexander S. Kechris & Alain Louveau - 1998 - Annals of Pure and Applied Logic 92 (1):63-112.
Analytics
Added to PP
2013-09-30
Downloads
35 (#678,037)
6 months
12 (#218,371)
2013-09-30
Downloads
35 (#678,037)
6 months
12 (#218,371)
Historical graph of downloads
Citations of this work
A descriptive Main Gap Theorem.Francesco Mangraviti & Luca Motto Ros - 2020 - Journal of Mathematical Logic 21 (1):2050025.
References found in this work
Countable borel equivalence relations.S. Jackson, A. S. Kechris & A. Louveau - 2002 - Journal of Mathematical Logic 2 (01):1-80.
Borel equivalence relations and classifications of countable models.Greg Hjorth & Alexander S. Kechris - 1996 - Annals of Pure and Applied Logic 82 (3):221-272.
Classification Theory and the Number of Nonisomorphic Models.S. Shelah - 1982 - Journal of Symbolic Logic 47 (3):694-696.
Borel equivalence relations induced by actions of the symmetric group.Greg Hjorth, Alexander S. Kechris & Alain Louveau - 1998 - Annals of Pure and Applied Logic 92 (1):63-112.
New dichotomies for borel equivalence relations.Greg Hjorth & Alexander S. Kechris - 1997 - Bulletin of Symbolic Logic 3 (3):329-346.
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-99fc7d78b-xhc6d uwo