a1 Kurt Gödel Research Center for Mathematical Logic, University of Vienna, Wahringer Straße 25, A-1090 Vienna, Austria, E-mail: email@example.com
a2 Kurt Gödel Research Center for Mathematical Logic, University of Vienna, Wahringer Straße 25, A-1090 Vienna, Austria, E-mail: firstname.lastname@example.org
Louveau and Rosendal  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 ) is far from complete (see [5, 2]).
In this article we strengthen the results of  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  about the comparison between isomorphism and bi-embeddability. Finally, as in  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 monoids.
(Received October 20 2009)
Key words and phrases