Related papers: Borel and countably determined reducibility in non…
The monadic theory of $(\mathbb R,\le)$ with quantification restricted to Borel sets is decidable. The Boolean combinations of $F_\sigma$ sets form an elementary substructure of the Borel sets. Under determinacy hypotheses, the proof…
Let $E$ be a countable Borel equivalence relation on the space $\mathcal{E}_{\infty}$ of all infinite partitions of the natural numbers. We show that $E$ coincides with equality below a Carlson-Simpson generic element of…
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…
The author has recently introduced the class of CNED sets in Euclidean space, generalizing the classical notion of NED sets, and shown that they are quasiconformally removable. A set $E$ is CNED if the conformal modulus of a curve family is…
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…
We study computably enumerable equivalence relations (ceers) on N and unravel a rich structural theory for a strong notion of reducibility among ceers.
We indicate a way of distinguishing between structures, for which, we call two structures distinguishable. Roughly, being distinguishable means that they differ in the number of realizations each gives for some formula. Being…
If E is an equivalence relation Borel reducible to E_1 \times E_3 then either E is Borel reducible to the equality of countable sets of reals or E_1 is Borel reducible to E. The "either" case admits further strengthening.
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…
In this paper we first consider hyperfinite Borel equivalence relations with a pair of Borel $\mathbb{Z}$-orderings. We define a notion of compatibility between such pairs, and prove a dichotomy theorem which characterizes exactly when a…
We define and study expansion problems on countable structures in the setting of descriptive combinatorics. We consider both expansions on countable Borel equivalence relations and on countable groups, in the Borel, measure and category…
Computable reducibility is a well-established notion that allows to compare the complexity of various equivalence relations over the natural numbers. We generalize computable reducibility by introducing degree spectra of reducibility and…
The following is true in the Solovay model. 1. If $\leq$ is a Borel partial quasi-order on a Borel set $D$ of the reals, $X$ is a ROD subset of $D$, and $\leq$ restricted to $X$ is linear, then $X$ is countably cofinal in the sense of…
Descriptive set theory is mainly concerned with studying subsets of the space of all countable binary sequences. In this paper we study the generalization where countable is replaced by uncountable. We explore properties of generalized…
We prove that topological isomorphism on procountable groups is not classifiable by countable structures, in the sense of descriptive set theory. In fact, the equivalence relation $\ell_\infty$ expressing that two sequences of reals have a…
Given a countable transitive model of set theory and a partial order contained in it, there is a natural countable Borel equivalence relation on generic filters over the model; two are equivalent if they yield the same generic extension. We…
We study the Borel-reducibility of isomorphism relations of complete first order theories and show the consistency of the following: For all such theories T and T', if T is classifiable and T' is not, then the isomorphism of models of T' is…
This paper contains results concerning the Borel reduction of the relation $E_0$ of eventual agreement between sequences of 0's and 1's, to the relation of permutative equivalence between basic sequences in a Banach space. For more clarity…
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…
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…