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