Switch to: References

Add citations

You must login to add citations.
  1. Uncountable structures are not classifiable up to bi-embeddability.Filippo Calderoni, Heike Mildenberger & Luca Motto Ros - 2019 - Journal of Mathematical Logic 20 (1):2050001.
    Answering some of the main questions from [L. Motto Ros, The descriptive set-theoretical complexity of the embeddability relation on models of large size, Ann. Pure Appl. Logic164(12) (2013) 1454–1492], we show that whenever κ is a cardinal satisfying κ<κ=κ>ω, then the embeddability relation between κ-sized structures is strongly invariantly universal, and hence complete for (κ-)analytic quasi-orders. We also prove that in the above result we can further restrict our attention to various natural classes of structures, including (generalized) trees, graphs, or (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • Uniformity, universality, and computability theory.Andrew S. Marks - 2017 - Journal of Mathematical Logic 17 (1):1750003.
    We prove a number of results motivated by global questions of uniformity in computabi- lity theory, and universality of countable Borel equivalence relations. Our main technical tool is a game for constructing functions on free products of countable groups. We begin by investigating the notion of uniform universality, first proposed by Montalbán, Reimann and Slaman. This notion is a strengthened form of a countable Borel equivalence relation being universal, which we conjecture is equivalent to the usual notion. With this additional (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • The bi-embeddability relation for finitely generated groups II.Simon Thomas & Jay Williams - 2016 - Archive for Mathematical Logic 55 (3-4):385-396.
    We study the isomorphism and bi-embeddability relations on the spaces of Kazhdan groups and finitely generated simple groups.
    Download  
     
    Export citation  
     
    Bookmark   1 citation