Switch to: Citations

Add references

You must login to add references.
  1. Denumerable Models of Complete Theories.R. L. Vaught, Lars Svenonius, Erwin Engeler & Gebhard Fukrken - 1970 - Journal of Symbolic Logic 35 (2):342-344.
    Download  
     
    Export citation  
     
    Bookmark   18 citations  
  • The Borel Complexity of Isomorphism for Theories with Many Types.David Marker - 2007 - Notre Dame Journal of Formal Logic 48 (1):93-97.
    During the Notre Dame workshop on Vaught's Conjecture, Hjorth and Kechris asked which Borel equivalence relations can arise as the isomorphism relation for countable models of a first-order theory. In particular, they asked if the isomorphism relation can be essentially countable but not tame. We show this is not possible if the theory has uncountably many types.
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • A Note on Counterexamples to the Vaught Conjecture.Greg Hjorth - 2007 - Notre Dame Journal of Formal Logic 48 (1):49-51.
    If some infinitary sentence provides a counterexample to Vaught's Conjecture, then there is an infinitary sentence which also provides a counterexample but has no model of cardinality bigger than ℵ₁.
    Download  
     
    Export citation  
     
    Bookmark   5 citations