- 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
Some dichotomy theorems for isomorphism relations of countable models
Journal of Symbolic Logic 66 (2):902-922 (2001)
Abstract
Strengthening known instances of Vaught Conjecture, we prove the Glimm-Effros dichotomy theorems for countable linear orderings and for simple trees. Corollaries of the theorems answer some open questions of Friedman and Stanley in an L ω 1ω -interpretability theory. We also give a survey of this theoryOther 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
End extensions and numbers of countable models.Saharon Shelah - 1978 - Journal of Symbolic Logic 43 (3):550-562.
Reflections on Skolem's Paradox.Timothy Bays - 2000 - Dissertation, University of California, Los Angeles
Sequences in countable nonstandard models of the natural numbers.Steven C. Leth - 1988 - Studia Logica 47 (3):243 - 263.
Rich models.Michael H. Albert & Rami P. Grossberg - 1990 - Journal of Symbolic Logic 55 (3):1292-1298.
Skolem's Paradox.Timothy Bays - 2012 - In Ed Zalta, Stanford Encyclopedia of Philosophy. Stanford, CA: Stanford Encyclopedia of Philosophy.
On representation theorems for nonmonotonic consequence relations.Ramon Perez & Carlos Uzcategui - 2000 - Journal of Symbolic Logic 65 (3):1321-1337.
Countable models of trivial theories which admit finite coding.James Loveys & Predrag Tanovic - 1996 - Journal of Symbolic Logic 61 (4):1279-1286.
A note on countable complete theories having three isomorphism types of countable models.Robert E. Woodrow - 1976 - Journal of Symbolic Logic 41 (3):672-680.
Analytics
Added to PP
2009-01-28
Downloads
127 (#358,480)
6 months
25 (#397,936)
2009-01-28
Downloads
127 (#358,480)
6 months
25 (#397,936)
Historical graph of downloads
Citations of this work
Scott Sentence Complexities of Linear Orderings.David Gonzalez & Dino Rossegger - forthcoming - Journal of Symbolic Logic:1-30.
Complexity Ranks of Countable Models.Su Gao - 2007 - Notre Dame Journal of Formal Logic 48 (1):33-48.
Uncountable structures are not classifiable up to bi-embeddability.Filippo Calderoni, Heike Mildenberger & Luca Motto Ros - 2019 - Journal of Mathematical Logic 20 (1):2050001.
Classes of structures with no intermediate isomorphism problems.Antonio Montalbán - 2016 - Journal of Symbolic Logic 81 (1):127-150.
References found in this work
Try MATCHA Writer if you're interested in citing directly from PhilPapers and certifying your authorship.
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