Related papers: Analytic equivalence relations and bi-embedability

We determine the exact complexity of classifying compact metric spaces up to homeomorphism. More precisely, the homeomorphism relation on compact metric spaces is Borel bi-reducible with the complete orbit equivalence relation of Polish…

A Borel equivalence relation on a Polish space is said to be countable if all of its equivalence classes are countable. Standard examples of countable Borel equivalence relations (on the space of subsets of the integers) that occur in…

We prove that topological isomorphism on procountable groups is not classifiable by countable structures, in the sense of descriptive set theory. In fact, the equivalence relation $\ell_\infty$ expressing that two sequences of reals have a…

We study the class of Borel equivalence relations under continuous reducibility. In particular , we characterize when a Borel equivalence relation with countable equivalence classes is $\Sigma$ 0 $\xi$ (or $\Pi$ 0 $\xi$). We characterize…

We show that if an equivalence relation $E$ on a Polish space is a countable union of smooth Borel subequivalence relations, then there is either a Borel reduction of $E$ to a countable Borel equivalence relation on a Polish space or a…

Friedman and Stanley developed the notion of Borel reducibility and illustrated its use in comparing classification problems for some familiar classes of countable structures. For many embeddings, the fact that the embedding is $1-1$ on…

We study Borel equivalence relations induced by Borel actions of tsi Polish groups on standard Borel spaces. We characterize when such an equivalence relation admits classification by countable structures using a variant of the $\mathbb…

We study the algorithmic complexity of embeddings between bi-embeddable equivalence structures. We define the notions of computable bi-embeddable categoricity, (relative) $\Delta^0_\alpha$ bi-embeddable categoricity, and degrees of…

We introduce the notions of u-amenability and hyper-u-amenability for countable Borel equivalence relations, strong forms of amenability that are implied by hyperfiniteness. We show that treeable, hyper-u-amenable countable Borel…

We study the Borel-reducibility of isomorphism relations of complete first order theories and show the consistency of the following: For all such theories T and T', if T is classifiable and T' is not, then the isomorphism of models of T' is…

A topological space is almost locally compact if it contains a dense locally compact subspace. We generalize a result from \cite{Ma}, showing that isomorphism on Borel classes of almost locally compact Polish metric structures is always…

We show that the category of countable Borel equivalence relations (CBERs) is dually equivalent to the category of countable $\mathcal{L}_{\omega_1\omega}$ theories which admit a one-sorted interpretation of a particular theory we call…

We consider reducibility of equivalence relations (ERs, for brevity), in a nonstandard domain, in terms of the Borel reducibility and the countably determined (CD, for brevity) reducibility. This reveals phenomena partially analogous to…

We prove that for a countable discrete group $\Gamma$ containing a copy of the free group $\F_n$, for some $2\leq n\leq\infty$, as a normal subgroup, the equivalence relations of conjugacy, orbit equivalence and von Neumann equivalence of…

In several classes of countable structures it is known that every hyperarithmetic structure has a computable presentation up to bi-embeddability. In this article we investigate the complexity of embeddings between bi-embeddable structures…

We prove that the homeomorphism relation between compact spaces can be continuously reduced to the homeomorphism equivalence relation between absolute retracts which strengthens and simplifies recent results of Chang and Gao, and Cie\'sla.…

It is shown that the isomorphism relation between continuous t-norms is Borel bireducible with the relation of order isomorphism between linear orders on the set of natural numbers, and therefore, it is a Borel complete equivalence…

The cut pseudo-metric on the space of graph limits induces an equivalence relation. The quotient space obtained by collapsing each equivalence class to a point is a metric space with appealing analytic properties. We show that the…

We study algorithmic learning of algebraic structures. In our framework, a learner receives larger and larger pieces of an arbitrary copy of a computable structure and, at each stage, is required to output a conjecture about the isomorphism…

We investigate natural variations of behaviourally correct learning and explanatory learning -- two learning paradigms studied in algorithmic learning theory -- that allow us to ``learn'' equivalence relations on Polish spaces. We give a…