English
Related papers

Related papers: An order analysis of hyperfinite Borel equivalence…

200 papers

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 prove that the problems of representing a finite ordered complemented semigroup or finite lattice-ordered semigroup as an algebra of binary relations over a finite set are undecidable. In the case that complementation is taken with…

Logic · Mathematics 2015-03-17 Murray Neuzerling

We study the complexity of isomorphism of classes of metric structures using methods from infinitary continuous logic. For Borel classes of locally compact structures, we prove that if the equivalence relation of isomorphism is potentially…

Logic · Mathematics 2021-09-20 Andreas Hallbäck , Maciej Malicki , Todor Tsankov

We provide a characterization of those relation algebras which are isomorphic to the algebras of compatible relations of some $\Z_2$-set. We further prove that this class is finitely axiomatizable in first-order logic in the language of…

Logic · Mathematics 2025-04-01 Jeremy F. Alm , John W. Snow

We continue the research of the relation $\hspace{1mm}\widetilde{\mid}\hspace{1mm}$ on the set $\beta {\mathbb{N}}$ of ultrafilters on ${\mathbb{N}}$, defined as an extension of the divisibility relation. It is a quasiorder, so we see it as…

Logic · Mathematics 2023-06-22 Boris Šobot

Given a nonempty set $\mathcal{L}$ of linear orders, we say that the linear order $L$ is $\mathcal{L}$-convex embeddable into the linear order $L'$ if it is possible to partition $L$ into convex sets indexed by some element of $\mathcal{L}$…

Logic · Mathematics 2025-05-06 Martina Iannella , Alberto Marcone , Luca Motto Ros , Vadim Weinstein

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

We study classes of Borel subsets of the real line $\mathbb{R}$ such as levels of the Borel hierarchy and the class of sets that are reducible to the set $\mathbb{Q}$ of rationals, endowed with the Wadge quasi-order of reducibility with…

Logic · Mathematics 2021-03-11 Daisuke Ikegami , Philipp Schlicht , Hisao Tanaka

This paper studies the homotopy theory of algebras and homotopy algebras over an operad. It provides an exhaustive description of their higher homotopical properties using the more general notion of morphisms called infinity-morphisms. The…

Algebraic Topology · Mathematics 2016-02-09 Bruno Vallette

We investigate the descriptive set-theoretic complexity of the solvability of a Borel family of linear equations over a finite field. Answering a question of Thornton, we show that this problem is already hard, namely $\Sigma^1_2$-complete.…

Logic · Mathematics 2025-01-13 Jan Grebík , Zoltán Vidnyánszky

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

When a linear order has an order preserving surjection onto each of its suborders we say that it is strongly surjective. We prove that the set of countable strongly surjective linear orders is complete for the class of sets which are the…

Logic · Mathematics 2020-06-30 Riccardo Camerlo , Raphaël Carroy , Alberto Marcone

We show that the uniform measure-theoretic ergodic decomposition of a countable Borel equivalence relation $(X, E)$ may be realized as the topological ergodic decomposition of a continuous action of a countable group $\Gamma…

Logic · Mathematics 2023-06-22 Ruiyuan Chen

In this paper, we analyze the Borel complexity of the topological conjugacy relation on Toeplitz subshifts. More specifically, we prove that topological conjugacy of Toeplitz subshifts with separated holes is hyperfinite. Indeed, we show…

Logic · Mathematics 2017-06-30 Burak Kaya

Fix $n=1,2,3,\dots$ or $n=\omega$. We prove a dichotomy for Borel homomorphisms from the $n$-th Friedman-Stanley jump $=^{+n}$ to an equivalence relation $E$ which is classifiable by countable structures: if there is no reduction from…

Logic · Mathematics 2024-05-29 Assaf Shani

We prove that the relation of bisimilarity between countable labelled transition systems is $\Sigma_1^1$-complete (hence not Borel), by reducing the set of non-wellorders over the natural numbers continuously to it. This has an impact on…

Logic · Mathematics 2015-12-16 Pedro Sánchez Terraf

Working in the framework of Borel reducibility, we study various notions of embeddability between groups. We prove that the embeddability between countable groups, the topological embeddability between (discrete) Polish groups, and the…

Logic · Mathematics 2018-02-08 Filippo Calderoni , Luca Motto Ros

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…

Logic · Mathematics 2024-09-05 Rishi Banerjee , Ruiyuan Chen

We prove a analog of Kurosh theorem for countable Borel equivalence relations giving the structure of sub-relations in free products.

Dynamical Systems · Mathematics 2009-02-24 Aurelien Alvarez

We first explain how to endow the space of subequivalence relations of any non-singular countable equivalence relation with a Polish topology, extending the framework of Kechris' recent monograph on subequivalence relations of probability…

Dynamical Systems · Mathematics 2026-04-15 François Le Maître