Analytic equivalence relations and bi-embeddability
Journal of Symbolic Logic 76 (1):243 - 266 (2011)
Abstract
Louveau and Rosendal [5] have shown that the relation of bi-embeddability for countable graphs as well as for many other natural classes of countable structures is complete under Borel reducibility for analytic equivalence relations. This is in strong contrast to the case of the isomorphism relation, which as an equivalence relation on graphs (or on any class of countable structures consisting of the models of a sentence of L ω ₁ ω ) is far from complete (see [5, 2]). In this article we strengthen the results of [5] by showing that not only does bi-embeddability give rise to analytic equivalence relations which are complete under Borel reducibility, but in fact any analytic equivalence relation is Borel equivalent to such a relation. This result and the techniques introduced answer questions raised in [5] about the comparison between isomorphism and bi-embeddability. Finally, as in [5] our results apply not only to classes of countable structures defined by sentences of ω ₁ ω , but also to discrete metric or ultrametric Polish spaces, compact metrizable topological spaces and separable Banach spaces, with various notions of embeddability appropriate for these classes, as well as to actions of Polish monoidsAuthor's Profile
DOI
10.2178/jsl/1294170999
My notes
Similar books and articles
Cofinal families of Borel equivalence relations and quasiorders.Christian Rosendal - 2005 - Journal of Symbolic Logic 70 (4):1325-1340.
Borel reducibility and Hölder(α) embeddability between Banach spaces.Longyun Ding - 2012 - Journal of Symbolic Logic 77 (1):224-244.
Infinite Time Decidable Equivalence Relation Theory.Samuel Coskey & Joel David Hamkins - 2011 - Notre Dame Journal of Formal Logic 52 (2):203-228.
Actions of non-compact and non-locally compact polish groups.Sławomir Solecki - 2000 - Journal of Symbolic Logic 65 (4):1881-1894.
Classifying positive equivalence relations.Claudio Bernardi & Andrea Sorbi - 1983 - Journal of Symbolic Logic 48 (3):529-538.
Borel structures and borel theories.Greg Hjorth & André Nies - 2011 - Journal of Symbolic Logic 76 (2):461 - 476.
Borel equivalence relations which are highly unfree.Greg Hjorth - 2008 - Journal of Symbolic Logic 73 (4):1271-1277.
Isomorphism relations on computable structures.Ekaterina B. Fokina, Sy-David Friedman, Valentina Harizanov, Julia F. Knight, Charles Mccoy & Antonio Montalbán - 2012 - Journal of Symbolic Logic 77 (1):122-132.
Diagonal Actions and Borel Equivalence Relations.Longyun Ding & Su Gao - 2006 - Journal of Symbolic Logic 71 (4):1081 - 1096.
The complexity of continuous embeddability between dendrites.Alberto Marcone & Christian Rosendal - 2004 - Journal of Symbolic Logic 69 (3):663-673.
An algebraic result about soft model theoretical equivalence relations with an application to H. Friedman's fourth problem.Daniele Mundici - 1981 - Journal of Symbolic Logic 46 (3):523-530.
On Σ1 1 equivalence relations with Borel classes of bounded rank.Ramez L. Sami - 1984 - Journal of Symbolic Logic 49 (4):1273 - 1283.
The {L}aczkovich—{K}omjáth property for coanalytic equivalence relations.Su Gao, Steve Jackson & Vincent Kieftenbeld - 2010 - Journal of Symbolic Logic 75 (3):1091-1101.
Analytics
Added to PP
2013-09-30
Downloads
8 (#987,925)
6 months
1 (#447,993)
2013-09-30
Downloads
8 (#987,925)
6 months
1 (#447,993)
Historical graph of downloads
Author's Profile
Citations of this work
Questions on generalised Baire spaces.Yurii Khomskii, Giorgio Laguzzi, Benedikt Löwe & Ilya Sharankou - 2016 - Mathematical Logic Quarterly 62 (4-5):439-456.
The descriptive set-theoretical complexity of the embeddability relation on models of large size.Luca Motto Ros - 2013 - Annals of Pure and Applied Logic 164 (12):1454-1492.
Coarse groups, and the isomorphism problem for oligomorphic groups.André Nies, Philipp Schlicht & Katrin Tent - 2021 - Journal of Mathematical Logic 22 (1).
Polish metric spaces with fixed distance set.Riccardo Camerlo, Alberto Marcone & Luca Motto Ros - 2020 - Annals of Pure and Applied Logic 171 (10):102832.
Uncountable structures are not classifiable up to bi-embeddability.Filippo Calderoni, Heike Mildenberger & Luca Motto Ros - 2019 - Journal of Mathematical Logic 20 (1):2050001.
References found in this work
A borel reducibility theory for classes of countable structures.Harvey Friedman & Lee Stanley - 1989 - Journal of Symbolic Logic 54 (3):894-914.
The complexity of continuous embeddability between dendrites.Alberto Marcone & Christian Rosendal - 2004 - Journal of Symbolic Logic 69 (3):663-673.