Some dichotomy theorems for isomorphism relations of countable models

Journal of Symbolic Logic 66 (2):902-922 (2001)
  Copy   BIBTEX

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 theory

Categories

Keywords

Reprint years

DOI

10.2307/2695052

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 100,497

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

Knight's model, its automorphism group, and characterizing the uncountable cardinals.Greg Hjorth - 2002 - Journal of Mathematical Logic 2 (01):113-144.
Dichotomy theorems for countably infinite dimensional analytic hypergraphs.Benjamin D. Miller - 2011 - Annals of Pure and Applied Logic 162 (7):561-565.
Comparing Borel Reducibility and Depth of an ω-Stable Theory.Martin Koerwien - 2009 - Notre Dame Journal of Formal Logic 50 (4):365-380.
Representation Theorems for Quantales.Silvio Valentini - 1994 - Mathematical Logic Quarterly 40 (2):182-190.
The cardinals below | [ ω 1 ] ω 1 |.W. Hugh Woodin - 2006 - Annals of Pure and Applied Logic 140 (1-3):161-232.
The graph-theoretic approach to descriptive set theory.Benjamin D. Miller - 2012 - Bulletin of Symbolic Logic 18 (4):554-575.
On κ-hereditary Sets and Consequences of the Axiom of Choice.Karl-Heinz Diener - 2000 - Mathematical Logic Quarterly 46 (4):563-568.
Dual easy uniformization and model-theoretic descriptive set theory.Shaughan Lavine - 1991 - Journal of Symbolic Logic 56 (4):1290-1316.

Analytics

Added to PP
2009-01-28

Downloads
38 (#582,994)

6 months
10 (#377,653)

Historical graph of downloads
How can I increase my 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.

Add more citations

References found in this work

Descriptive Set Theory.Yiannis Nicholas Moschovakis - 1982 - Studia Logica 41 (4):429-430.
Scott sentences and admissible sets.Mark Nadel - 1974 - Annals of Mathematical Logic 7 (2):267.

Add more references