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 theory
Keywords No keywords specified (fix it)
Categories (categorize this paper)
DOI 10.2307/2695052
Options
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

PhilArchive copy


Upload a copy of this paper     Check publisher's policy     Papers currently archived: 71,464
Through your library

References found in this work BETA

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

Citations of this work BETA

Complexity Ranks of Countable Models.Su Gao - 2007 - Notre Dame Journal of Formal Logic 48 (1):33-48.

Add more citations

Similar books and articles

Analytics

Added to PP index
2009-01-28

Total views
8 ( #1,010,831 of 2,520,772 )

Recent downloads (6 months)
1 ( #405,623 of 2,520,772 )

How can I increase my downloads?

Downloads

My notes