On the complexity of the relations of isomorphism and bi-embeddability

DOI10.1090/S0002-9939-2011-10896-7zbMath1245.03068arXiv1112.0349OpenAlexW2963233311MaRDI QIDQ5388809

Luca Motto Ros

Publication date: 20 April 2012

Published in: Proceedings of the American Mathematical Society (Search for Journal in Brave)

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

zbMATH Keywords

isomorphismBorel reducibilitybi-embeddabilityanalytic equivalence relation

Mathematics Subject Classification ID

Descriptive set theory (03E15) Other infinitary logic (03C75)

Related Items (6)

Coarse groups, and the isomorphism problem for oligomorphic groups ⋮ Souslin quasi-orders and bi-embeddability of uncountable structures ⋮ Uncountable structures are not classifiable up to bi-embeddability ⋮ On isometry and isometric embeddability between ultrametric Polish spaces ⋮ Invariantly universal analytic quasi-orders ⋮ Weihrauch Complexity in Computable Analysis

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Descriptive set theory
• Some dichotomy theorems for isomorphism relations of countable models
• Invariantly universal analytic quasi-orders
• A Borel reductibility theory for classes of countable structures
• Analytic equivalence relations and bi-embeddability
• Complete analytic equivalence relations

This page was built for publication: On the complexity of the relations of isomorphism and bi-embeddability