The descriptive set-theoretical complexity of the embeddability relation on models of large size

DOI10.1016/J.APAL.2013.06.018zbMath1320.03077arXiv1112.0354OpenAlexW2963197018MaRDI QIDQ490674

Luca Motto Ros

Publication date: 27 August 2015

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1112.0354

zbMATH Keywords

embeddability relationgeneralised Cantor spacegeneralised descriptive set theoryinfinitary logicsinvariant universalityweakly compact cardinals

Mathematics Subject Classification ID

Descriptive set theory (03E15) Large cardinals (03E55) Partition relations (03E02)

Related Items (12)

THE COMPLEXITY OF THE EMBEDDABILITY RELATION BETWEEN TORSION-FREE ABELIAN GROUPS OF UNCOUNTABLE SIZE ⋮ Can we classify complete metric spaces up to isometry? ⋮ Souslin quasi-orders and bi-embeddability of uncountable structures ⋮ On middle box products and paracompact cardinals ⋮ Generalized Polish spaces at regular uncountable cardinals ⋮ Uncountable structures are not classifiable up to bi-embeddability ⋮ On $\Sigma _1^1$-completeness of quasi-orders on $\kappa ^\kappa $ ⋮ Square compactness and the filter extension property ⋮ The Hurewicz dichotomy for generalized Baire spaces ⋮ On ‐complete equivalence relations on the generalized Baire space ⋮ Generalized Choquet spaces ⋮ Questions on generalised Baire spaces

This page was built for publication: The descriptive set-theoretical complexity of the embeddability relation on models of large size