Related papers: Forcing constructions and countable Borel equivale…

Let $K\subset R^n$ be a compact basic semi-algebraic set. We provide a necessary and sufficient condition (with no a priori bounding parameter) for a real sequence $y=(y_\alpha)$, $\alpha\in N^n$, to have a finite representing Borel measure…

We investigate and compare $\mathcal F$-Borel classes and absolute $\mathcal F$-Borel classes. We provide precise examples distinguishing these two hierarchies. We also show that for separable metrizable spaces, $\mathcal F$-Borel classes…

We prove that the orbit closure of the determinant is not normal. A similar result is obtained for the orbit closure of the permanent multiplied by a power of a linear form.

In this short note, we shall prove some observations regarding the connection between indestructible $\omega_1$-guessing models and the $\omega_1$-approximation property of forcing notions.

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…

We present a counterexample to Conjecture~14.1.6 from [Vladimir Kanovei, Borel equivalence relations], regarding Borel equivalence relations on product spaces.

We establish orbit equivalence rigidity for any ergodic, essentially free and measure-preserving action on a standard Borel space with a finite positive measure of the mapping class group for a compact orientable surface with higher…

We develop a toolbox for forcing over arbitrary models of set theory without the axiom of choice. In particular, we introduce a variant of the countable chain condition and prove an iteration theorem that applies to many classical forcings…

We consider a quartic O(N)-vector model. Using the Loop Vertex Expansion, we prove the Borel summability in 1/N along the real axis of the partition function and of the connected correlations of the model. The Borel summability holds…

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…

We prove several results showing that every locally finite Borel graph whose large-scale geometry is "tree-like" induces a treeable equivalence relation. In particular, our hypotheses hold if each component of the original graph either has…

The purpose of this paper is to investigate forcing as a tool to construct universal models. In particular, we look at theories of initial segments of the universe and show that any model of a sufficiently rich fragment of those theories…

In [9] we proved that the space of countable torsion-free abelian groups is Borel complete. In this paper we show that our construction from [9] satisfies several additional properties of interest. We deduce from this that countable…

We take the first steps towards a better understanding of continuous orbit equivalence, i.e., topological orbit equivalence with continuous cocycles. First, we characterise continuous orbit equivalence in terms of isomorphisms of C*-crossed…

We prove that, for every Coxeter diagram $D$ with no rank $3$ residues of spherical type and such that $D$ has not only edges labelled by $2$, the space of countable (Tits) buildings of type $D$ is Borel complete, that is, classifying…

We show that polynomial time Turing equivalence and a large class of other equivalence relations from computational complexity theory are universal countable Borel equivalence relations. We then discuss ultrafilters on the invariant Borel…

We study the connectedness property of the spectrum of forcing algebras over a noetherian ring. In particular we present for an integral base ring a geometric criterion for connectedness in terms of horizontal and vertical components of the…

In this paper we establish a new equivalence relation on the spaces of almost periodic functions which allows us to prove a result like Bohr's equivalence theorem extended to the case of all these functions.

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…

We introduce and study the notion of functorial Borel complexity for Polish groupoids. Such a notion aims at measuring the complexity of classifying the objects of a category in a constructive and functorial way. In the particular case of…