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 complexity of continuous embeddability between dendrites.Alberto Marcone & Christian Rosendal - 2004 - Journal of Symbolic Logic 69 (3):663-673.
    We show that the quasi-order of continuous embeddability between finitely branching dendrites (a natural class of fairly simple compacta) is $\Sigma_1^1$ -complete. We also show that embeddability between countable linear orders with infinitely many colors is $\Sigma_1^1$ -complete.
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • [Omnibus Review].Yiannis N. Moschovakis - 1968 - Journal of Symbolic Logic 33 (3):471-472.
    Download  
     
    Export citation  
     
    Bookmark   55 citations