Related papers: On $\ell^{p}$-like equivalence relations
We develop a correspondence between the study of Borel equivalence relations induced by closed subgroups of $S_\infty$, and the study of symmetric models and weak choice principles, and apply it to prove a conjecture of…
The complexity of equivalence relations has received much attention in the recent literature. The main tool for such endeavour is the following reducibility: given equivalence relations $R$ and $S$ on natural numbers, $R$ is computably…
The following will be shown: Let $I$ be a $\sigma$-ideal on a Polish space $X$ with the property that the associated forcing of $I^+$ Borel subsets ordered by $\subseteq$ is a proper forcing. Let E be an analytic or coanalytic equivalence…
In this paper we first consider hyperfinite Borel equivalence relations with a pair of Borel $\mathbb{Z}$-orderings. We define a notion of compatibility between such pairs, and prove a dichotomy theorem which characterizes exactly when a…
We prove that for every Borel equivalence relation $E$, either $E$ is Borel reducible to $\mathbb{E}\_0$, or the family of Borel equivalence relations incompatible with $E$ has cofinal essential complexity. It follows that if $F$ is a Borel…
We introduce an analog of the theory of Borel equivalence relations in which we study equivalence relations that are decidable by an infinite time Turing machine. The Borel reductions are replaced by the more general class of infinite time…
We show that every basis for the countable Borel equivalence relations strictly above $\mathbb{E}_0$ under measure reducibility is uncountable, thereby ruling out natural generalizations of the Glimm-Effros dichotomy. We also push many…
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…
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…
We present a selection of basic results on Borel reducibility of Borel ideals and equivalence relations, especially those with comparably short proofs. The focal point are reducibility/irreducibility results related to some special…
This paper is devoted to the study of analytic equivalence relations which are Borel graphable, i.e. which can be realized as the connectedness relation of a Borel graph. Our main focus is the question of which analytic equivalence…
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…
This paper deals with countable products of countable Borel equivalence relations and equivalence relations "just above" those in the Borel reducibility hierarchy. We show that if $E$ is strongly ergodic with respect to $\mu$ then…
The main question here is the possible generalization of the following theorem on ``simple'' equivalence relation on 2^omega to higher cardinals. Theorem: (1) Assume that: (a) E is a Borel 2-place relation on 2^omega, (b) E is an…
In this paper, a notion of Schauder equivalence relation $\mathbb R^\mathbb N/L$ is introduced, where $L$ is a linear subspace of $\mathbb R^\mathbb N$ and the unit vectors form a Schauder basis of $L$. The main theorem is to show that the…
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 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…
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 study the relative complexity of equivalence relations and preorders from computability theory and complexity theory. Given binary relations $R, S$, a componentwise reducibility is defined by $ R\le S \iff \ex f \, \forall x, y \, [xRy…
A sequence $\textbf{p}=(p_{n})$ of real numbers is called Abel convergent to $\ell$ if the series $\Sigma_{k=0}^{\infty}p_{k}x^{k}$ is convergent for $0\leq x<1$ and \[\lim_{x \to 1^{-}}(1-x) \sum_{k=0}^{\infty}p_{k}x^{k}=\ell.\] We…