Switch to: Citations

Add references

You must login to add references.
  1. Discrete o-minimal structures.Anand Pillay & Charles Steinhorn - 1987 - Annals of Pure and Applied Logic 34 (3):275-289.
    Download  
     
    Export citation  
     
    Bookmark   8 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