English
Related papers

Related papers: A weak dichotomy below E_1 \times E_3

200 papers

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…

Logic · Mathematics 2014-12-31 John D. Clemens , Dominique Lecomte , Benjamin D. Miller

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…

Logic · Mathematics 2025-01-22 N. de Rancourt , B. D. Miller

We establish a dichotomy theorem characterizing the circumstances under which a treeable Borel equivalence relation E is essentially countable. Under additional topological assumptions on the treeing, we in fact show that E is essentially…

Logic · Mathematics 2014-08-19 Dominique Lecomte , John D. Clemens , Benjamin D. Miller

We prove the following dichotomy. Given an analytic equivalence relation $E$, either ${E_0^{\mathbb{N}}}\leq_B{E}$ or else any Borel homomorphism from $E_0^{\mathbb{N}}$ to $E$ is "very far from a reduction", specifically, it factors, on a…

Logic · Mathematics 2024-08-05 Assaf Shani

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…

Logic · Mathematics 2020-02-25 Clinton T. Conley , Benjamin D. Miller

The study of Borel equivalence relations under Borel reducibility has developed into an important area of descriptive set theory. The dichotomies of Silver and Harrington-Kechris-Louveau show that with respect to Borel reducibility, any…

Logic · Mathematics 2009-07-07 Ekaterina B. Fokina , Sy-David Friedman , Asger Tornquist

Let $F_{\omega_1}$ be the countable admissible ordinal equivalence relation defined on ${}^\omega 2$ by $x \ F_{\omega_1} \ y$ if and only if $\omega_1^x = \omega_1^y$. It will be shown that $F_{\omega_1}$ is classifiable by countable…

Logic · Mathematics 2016-02-01 William Chan

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…

Logic · Mathematics 2018-08-16 Vladimir Kanovei

For $f \colon [0,1] \rar \real^{+}$, consider the relation $\mathbf{E}_{f}$ on $[0,1]^{\omega}$ defined by $(x_{n}) \mathbf{E}_{f} (y_{n}) \Leftrightarrow \sum_{n < \omega} f(|y_{n} - x_{n}|) < \infty.$ We study the Borel reducibility of…

Logic · Mathematics 2009-11-17 Tamás Mátrai

We introduce a notion of relative primeness for equivalence relations, strengthening the notion of non-reducibility, and show for many standard benchmark equivalence relations that non-reducibility may be strengthened to relative primeness.…

Logic · Mathematics 2021-04-20 John D. Clemens

The notion of computable reducibility between equivalence relations on the natural numbers provides a natural computable analogue of Borel reducibility. We investigate the computable reducibility hierarchy, comparing and contrasting it with…

Logic · Mathematics 2019-02-06 Samuel Coskey , Joel David Hamkins , Russell Miller

We characterize having Borel isomorphism relation among some weakly minimal trivial theories, namely the examples of families of finite equivalence relations from recent joint work with Laskowski, and tame expansions of…

Logic · Mathematics 2024-09-23 Danielle Ulrich

Coskey, Hamkins, and Miller [CHM12] proposed two possible analogues of the class of countable Borel equivalence relations in the setting of computable reducibility of equivalence relations on the computably enumerable (c.e.) sets. The first…

Logic · Mathematics 2024-09-26 Uri Andrews , Luca San Mauro

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…

Logic · Mathematics 2019-08-16 Samuel Coskey , Joel David Hamkins

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…

Logic · Mathematics 2021-08-02 Jan Grebík

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…

Logic · Mathematics 2018-08-16 Vladimir Kanovei , Michael Reeken

A selection of basic results on Borel reducibility of ideals and equivalence relations, especially those with comparably short proofs. This is an unfinished text as yet. Some proofs have missing parts and loose ends. [email protected] and…

Logic · Mathematics 2018-08-16 Vladimir Kanovei

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…

Logic · Mathematics 2019-10-21 Assaf Shani

We prove that many seemingly simple theories have Borel complete reducts. Specifically, if a countable theory has uncountably many complete 1-types, then it has a Borel complete reduct. Similarly, if $Th(M)$ is not small, then $M^{eq}$ has…

Logic · Mathematics 2021-09-21 Michael C. Laskowski , Douglas S. Ulrich

Let $(X_n,d_n),\,n\in\Bbb N$ be a sequence of pseudo-metric spaces, $p\ge 1$. For $x,y\in\prod_{n\in\Bbb N}X_n$, let $(x,y)\in E((X_n)_{n\in\Bbb N};p)\Leftrightarrow\sum_{n\in\Bbb N}d_n(x(n),y(n))^p<+\infty$. For Borel reducibility between…

Logic · Mathematics 2010-07-05 Longyun Ding
‹ Prev 1 2 3 10 Next ›