English
Related papers

Related papers: Borel and countably determined reducibility in non…

200 papers

The following is true in the Solovay model. 1. If $\le$ is a Borel partial order on a set $D$ of the reals, and $X$ is a ROD subset of $D$ linearly ordered by $\le$, then the restriction of $\le$ onto $X$ is countably cofinal. 2. If in…

Logic · Mathematics 2018-08-16 Vladimir Kanovei

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

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

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…

Logic · Mathematics 2026-02-03 Petr Naryshkin , Andrea Vaccaro

We prove that the automorphisms of any separable C*-algebra that does not have continuous trace are not classifiable by countable structures up to unitary equivalence. This implies a dichotomy for the Borel complexity of the relation of…

Operator Algebras · Mathematics 2016-05-06 Martino Lupini

A variation of the Scott analysis of countable structures is applied to actions of non-Archimedean TSI Polish groups acting continuously on a Polish spaces. We give results on the potential Borel complexity spectrum of such groups, and…

Logic · Mathematics 2023-04-05 Shaun Allison

We systematically investigate three different equivalence relations of connectedness: being connected by arcs, being connected by continua and being connected by chains of continua of decreasing diameter. The investigation is conducted from…

General Topology · Mathematics 2026-01-05 Michal Hevessy , Yusuf Uyar , Benjamin Vejnar

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…

Logic · Mathematics 2026-05-07 David Gonzalez , Julia Knight

We prove that the equivalence of pure states of a separable C*-algebra is either smooth or it continuously reduces $[0,1]^{\bbN}/\ell_2$ and it therefore cannot be classified by countable structures. The latter was independently proved by…

Operator Algebras · Mathematics 2010-02-01 Ilijas Farah

This paper concerns the compactness and separability properties of the normed Boolean algebras (N.B.A.) with respect to topology generated by a distance equal to the square root of a measure of symmetric difference between two elements. The…

General Topology · Mathematics 2022-02-08 Vesna Gotovac Đogaš

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 analyze the degree-structure induced by large reducibilities under the Axiom of Determinacy. This generalizes the analysis of Borel reducibilities given in references [1], [6] and [5] e.g. to the projective levels.

Logic · Mathematics 2010-03-25 Luca Motto Ros

We show that the theory of the partial order of computably enumerable equivalence relations (ceers) under computable reduction is 1-equivalent to true arithmetic. We show the same result for the structure comprised of the dark ceers and the…

Logic · Mathematics 2020-02-25 Uri Andrews , Noah Schweber , Andrea Sorbi

We introduce the notion of finitary computable reducibility on equivalence relations on the natural numbers. This is a weakening of the usual notion of computable reducibility, and we show it to be distinct in several ways. In particular,…

Logic · Mathematics 2018-02-12 Russell Miller , Keng Meng Ng

We study the isomorphism relation on Borel classes of locally compact Polish metric structures. We prove that isomorphism on such classes is always classifiable by countable structures (equivalently: Borel reducible to graph isomorphism),…

Logic · Mathematics 2024-05-22 Maciej Malicki

We prove that in some cases definable chains of Borel partial orderings are necessarily countably cofinal. This includes the following cases: analytic chains, ROD chains in the Solovay model, and $\Sigma^1_2$ chains in the assumption that…

Logic · Mathematics 2018-08-16 Vladimir Kanovei

In this paper, we construct a compact subset of the real plane whose path-connectedness equivalence relation is Borel bireducible to a nonsmooth hyperfinite Borel equivalence relation. This answers a question of \cite{bec98}.

Logic · Mathematics 2025-02-18 Yusuf Uyar

We introduce and study a notion of Borel order dimension for Borel quasi orders. It will be shown that this notion is closely related to the notion of Borel dichromatic number for simple directed graphs. We prove a dichotomy, which…

Logic · Mathematics 2024-09-11 Dilip Raghavan , Ming Xiao

For $N \geq 2$, we study the structure of definable abelian group extensions of the additive group $(\mathbb{R}^N,+)$ by countable abelian (Borel) groups $G$. Given an extension $H$ of $(\mathbb{R}^N,+)$ by $G$, we measure the definability…

Logic · Mathematics 2025-05-13 Linus Richter

We study topological realizations of countable Borel equivalence relations, including realizations by continuous actions of countable groups, with additional desirable properties. Some examples include minimal realizations on any perfect…

Logic · Mathematics 2025-08-07 Joshua Frisch , Alexander Kechris , Forte Shinko , Zoltán Vidnyánszky