Switch to: Citations

Add references

You must login to add references.
  1. A borel reducibility theory for classes of countable structures.Harvey Friedman & Lee Stanley - 1989 - Journal of Symbolic Logic 54 (3):894-914.
    We introduce a reducibility preordering between classes of countable structures, each class containing only structures of a given similarity type (which is allowed to vary from class to class). Though we sometimes work in a slightly larger context, we are principally concerned with the case where each class is an invariant Borel class (i.e. the class of all models, with underlying set $= \omega$, of an $L_{\omega_1\omega}$ sentence; from this point of view, the reducibility can be thought of as a (...)
    Download  
     
    Export citation  
     
    Bookmark   49 citations  
  • The conjugacy problem for the automorphism group of the random graph.Samuel Coskey, Paul Ellis & Scott Schneider - 2011 - Archive for Mathematical Logic 50 (1-2):215-221.
    We prove that the conjugacy problem for the automorphism group of the random graph is Borel complete, and discuss the analogous problem for some other countably categorical structures.
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • Borel equivalence relations and classifications of countable models.Greg Hjorth & Alexander S. Kechris - 1996 - Annals of Pure and Applied Logic 82 (3):221-272.
    Using the theory of Borel equivalence relations we analyze the isomorphism relation on the countable models of a theory and develop a framework for measuring the complexity of possible complete invariants for isomorphism.
    Download  
     
    Export citation  
     
    Bookmark   23 citations