Related papers: Essential countability of treeable equivalence rel…

Gao and Jackson showed that any countable Borel equivalence relation (CBER) induced by a countable abelian Polish group is hyperfinite. This prompted Hjorth to ask if this is in fact true for all CBERs classifiable by (uncountable) abelian…

Let $T$ be a countable complete first-order theory with a definable, infinite, discrete linear order. We prove that $T$ has continuum-many countable models. The proof is purely first-order, but raises the question of Borel completeness of…

We extend anti-classification results in ergodic theory to the collection of weakly mixing systems by proving that the isomorphism relation as well as the Kakutani equivalence relation of weakly mixing invertible measure-preserving…

Given a countable o-minimal theory T, we characterize the Borel complexity of isomorphism for countable models of T up to two model-theoretic invariants. If T admits a nonsimple type, then it is shown to be Borel complete by embedding the…

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…

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$…

We prove a number of results about countable Borel equivalence relations with forcing constructions and arguments. These results reveal hidden regularity properties of Borel complete sections on certain orbits. As consequences they imply…

We show that if $E$ is a countable Borel equivalence relation on $\mathbb{R}^n$, then there is a closed subset $A \subset [0,1]^n$ of Hausdorff dimension $n$ so that $E \restriction A$ is smooth. More generally, if $\leq_Q$ is a locally…

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…

We show that several new classes of groups are measure strongly treeable. In particular, finitely generated groups admitting planar Cayley graphs, elementarily free groups, and the group of isometries of the hyperbolic plane and all its…

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 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 generalise the main theorems from the paper "The Borel cardinality of Lascar strong types" by I. Kaplan, B. Miller and P. Simon to a wider class of bounded invariant equivalence relations. We apply them to describe relationships between…

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…

We use edge slidings and saturated disjoint Borel families to give a conceptually simple proof of Hjorth's theorem on cost attained: if a countable p.m.p. ergodic equivalence relation $E$ is treeable and has cost $n \in \mathbb{N} \cup…

Nadkarni's Theorem asserts that for a countable Borel equivalence relation (CBER) exactly one of the following holds: (1) It has an invariant Borel probability measure or (2) it admits a Borel compression, i.e., a Borel injection that maps…

We show that Morley's theorem on the number of countable models of a countable first-order theory becomes an undecidable statement when extended to second-order logic. More generally, we calculate the number of equivalence classes of…

We consider a large family of theories of equivalence relations, each with finitely many classes, and assuming the existence of an $\omega$-Erdos cardinal, we determine which of these theories are Borel complete. We develop machinery,…

We present a streamlined exposition of a construction by R. Chen, A. Poulin, R. Tao, and A. Tserunyan, which proves the treeability of equivalence relations generated by any locally-finite Borel graph such that each component is a…

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…