Related papers: Relative primeness and Borel partition properties …

We introduce the notion of groupoid pre-equivalences and prove that they give rise to groupoid equivalences by taking certain quotients. Then, given an equivalence of Fell bundles $\mathscr{B}$ and $\mathscr{C}$ and another equivalence…

In $\mathsf{ZFC}$, if there is a measurable cardinal with infinitely many Woodin cardinals below it, then for every equivalence relation $E \in L(\mathbb{R})$ on $\mathbb{R}$ with all $\mathbf{\Delta}_1^1$ classes and every $\sigma$-ideal…

For a class $\mathcal K$ of countable relational structures, a countable Borel equivalence relation $E$ is said to be $\mathcal K$-structurable if there is a Borel way to put a structure in $\mathcal K$ on each $E$-equivalence class. We…

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…

In reference [8] we have considered a wide class of "well-behaved" reducibilities for sets of reals. In this paper we continue with the study of Borel reducibilities by proving a dichotomy theorem for the degree-structures induced by good…

We improve the known results about the complexity of the relation of isomorphism between separable Banach spaces up to Borel reducibility, and we achieve this using the classical spaces $c_0$, $\ell_p$ and $L_p$, $1 \leq p <2$. More…

In this paper we complete the attempt of H. Lefmann to show that Borel equivalence relations on the $n$-element subsets of $2^{\omega}$, that respect an order type, have a finite Ramsey basis.

We develop new tools to analyze the complexity of the conjugacy equivalence relation $E_\mathsf{lo}(G)$, whenever $G$ is a left-orderable group. Our methods are used to demonstrate non-smoothness of $E_\mathsf{lo}(G)$ for certain groups $G$…

After a short introduction to the general notion of Borel fields of metric spaces we introduce the notion of the action of an equivalence relation on such fields. Then, we specify the study to the Borel fields of proper CAT(0) spaces and we…

We investigate computability in the lattice of equivalence relations on the natural numbers. We mostly investigate whether the subsets of appropriately defined subrecursive equivalence relations -for example the set of all polynomial-time…

This paper improves two existing theorems of interest to neo-logicist philosophers of mathematics. The first is a classification theorem due to Fine for equivalence relations between concepts definable in a well-behaved second-order logic.…

We show that the embeddability relations for countable quandles and for countable fields of any given characteristic other than 2 are maximally complex in a strong sense: they are invariantly universal. This notion from the theory of Borel…

We investigate the $\mathcal F$-Borel complexity of topological spaces in their different compactifcations. We provide a simple proof of the fact that a space can have arbitrarily many different complexities in different compactifications.…

We generalise the notion of separable equivalence, originally presented by Linckelmann (2011), to an equivalence relation on additive categories. We use this generalisation to show that from an initial equivalence between two algebras we…

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…

Let $X_n, n\in\Bbb N$ be a sequence of non-empty sets, $\psi_n:X_n^2\to\Bbb R^+$. We consider the relation $E((X_n,\psi_n)_{n\in\Bbb N})$ on $\prod_{n\in\Bbb N}X_n$ by $(x,y)\in E((X_n,\psi_n)_{n\in\Bbb N})\Leftrightarrow\sum_{n\in\Bbb…

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…

We prove an analogue of the portmanteau theorem on weak convergence of probability measures allowing measures which are unbounded on an underlying metric space but finite on the complement of any Borel neighbourhood of a fixed element.

Given an analytic equivalence relation, we tend to wonder whether it is Borel. When it is non Borel, there is always the hope it will be Borel on a "large" set -- nonmeager or of positive measure. That has led Kanovei, Sabok and Zapletal to…

We show that if there exists a countable Borel equivalence relation which is hyper-hyperfinite but not hyperfinite then the complexity of hyperfinite countable Borel equivalence relations is as high as possible, namely,…