Uncountable structures are not classifiable up to bi-embeddability

DOI10.1142/S0219061320500014zbMath1485.03194arXiv1903.08091OpenAlexW2964153371MaRDI QIDQ5114807

Filippo Calderoni, Heike Mildenberger, Luca Motto Ros

Publication date: 26 June 2020

Published in: Journal of Mathematical Logic (Search for Journal in Brave)

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

zbMATH Keywords

generalized descriptive set theoryinfinitary logics(bi-)embeddability for uncountable structures

Mathematics Subject Classification ID

Descriptive set theory (03E15)

Related Items (3)

THE COMPLEXITY OF THE EMBEDDABILITY RELATION BETWEEN TORSION-FREE ABELIAN GROUPS OF UNCOUNTABLE SIZE ⋮ Souslin quasi-orders and bi-embeddability of uncountable structures ⋮ Computable embeddability for algebraic structures

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The bi-embeddability relation for finitely generated groups. II
• The descriptive set-theoretical complexity of the embeddability relation on models of large size
• The Hurewicz dichotomy for generalized Baire spaces
• Continuous images of closed sets in generalized Baire spaces
• Isomorphism of homogeneous structures
• On the complexity of the isomorphism relation for finitely generated groups
• Combinatorial group theory.
• Can we classify complete metric spaces up to isometry?
• On isometry and isometric embeddability between ultrametric Polish spaces
• Isomorphism of finitely generated solvable groups is weakly universal.
• Some dichotomy theorems for isomorphism relations of countable models
• On the Complexity of the Classification Problem for Torsion-Free Abelian Groups of Finite Rank
• Invariantly universal analytic quasi-orders
• The bi-embeddability relation for finitely generated groups
• Generalized Descriptive Set Theory and Classification Theory
• JSL volume 79 issue 2 Cover and Back matter
• A Borel reductibility theory for classes of countable structures
• Analytic equivalence relations and bi-embeddability
• Universality of group embeddability
• Trees and -subsets of ^ω1ω₁
• The completeness of the isomorphism relation for countable Boolean algebras
• The bi-embeddability relation for countable abelian groups
• The classification problem for torsion-free abelian groups of finite rank
• Set Theory
• The isomorphism relation on countable torsion free abelian groups
• On the classification of Polish metric spaces up to isometry
• Complete analytic equivalence relations
• On the complexity of the relations of isomorphism and bi-embeddability
• The classification of torsion-free abelian groups of finite rank up to isomorphism and up to quasi-isomorphism
• Remarks on predicate logic with infinitely long expressions
• On the complexity of the isomorphism relation for fields of finite transcendence degree

This page was built for publication: Uncountable structures are not classifiable up to bi-embeddability