Related papers: On countable cofinality and decomposition of defin…
We study notions of generic and coarse computability in the context of computable structure theory. Our notions are stratified by the $\Sigma_\beta$ hierarchy. We focus on linear orderings. We show that at the $\Sigma_1$ level all linear…
It is consistent that there is a partial order (P,<) of size aleph_1 such that every monotone (unary) function from P to P is first order definable in (P,<). The partial order is constructed in an extension obtained by finite support…
I study definable sets in affine continuous logic. Let $T$ be an affine theory. After giving some general results, it is proved that if $T$ has a first order model, its extremal theory is a complete first order theory and first order…
In a recent article, we introduced and studied a precise class of dynamical systems called solvable systems. These systems present a dynamic ruled by discontinuous ordinary differential equations with solvable right-hand terms and unique…
We investigate the descriptive complexity of the set of models of first-order theories. Using classical results of Knight and Solovay, we give a sharp condition for complete theories to have a $\pmb\Pi_\omega^0$-complete set of models. In…
A theorem of Galvin asserts that if the unordered pairs of reals are partitioned into finitely many Borel classes then there is a perfect set P such that all pairs from P lie in the same class. The generalization to n-tuples for n >= 3 is…
We consider positively supported Borel measures for which all moments exist. On the set of compactly supported measures in this class a partial order is defined via eventual dominance of the moment sequences. Special classes are identified…
We prove that the perfect set dichotomy theorem holds in the Solovay model $V ((\omega^\omega)^{V[G]})$. Namely, for every equivalence relation $E$ on $\mathbb{R}$, either $\mathbb{R}/E$ is well-orderable or there exists a perfect set…
We show that the automorphism groups of countably categorical linear orders are extremely amenable. Using methods of Kechris, Pestov, and Todorcevic, we use this fact to derive a structural Ramsey theorem for certain families of finite…
We make further observations on the features of Galois cohomology in the general model theoretic context. We make explicit the connection between forms of definable groups and first cohomology sets with coefficients in a suitable…
The usual definition of the set of constructible reals is $\Sigma ^1_2$. This set can have a simpler definition if, for example, it is countable or if every real is constructible. H. Friedman asked if the set of constructible reals can be…
We show that for any Polish group $G$ and any countable normal subgroup $\Gamma\triangleleft G$, the coset equivalence relation $G/\Gamma$ is a hyperfinite Borel equivalence relation. In particular, the outer automorphism group of any…
It was proved few years ago that classes of Boolean functions definable by means of functional equations \cite{EFHH}, or equivalently, by means of relational constraints \cite{Pi2}, coincide with initial segments of the quasi-ordered set…
We prove a relative version of the fact that semiorthogonal decompositions of the bounded derived category of coherent sheaves are strongly constrained by the base locus of the canonical linear system. As an application we prove that the…
We consider decompositions of the real line into pairwise disjoint Borel pieces so that each piece is closed under addition. How many pieces can there be? We prove among others that the number of pieces is either at most 3 or uncountable,…
Given a family $F$ of subsets of a group $G$ we describe the structure of its thin-completion $\tau^*(F)$, which is the smallest thin-complete family that contains $I$. A family $F$ of subsets of $G$ is called thin-complete if each $F$-thin…
We present a model of set theory, in which, for a given $n\ge2$, there exists a non-ROD-uniformizable planar lightface $\varPi^1_n$ set in $\mathbb R\times\mathbb R$, whose all vertical cross-sections are countable sets (and in fact Vitali…
In this paper we prove three theorems about the theory of Borel sets in models of ZF without any form of the axiom of choice. We prove that if B is a G-delta-sigma set, then either B is countable or B contains a perfect subset. Second, we…
Countable tightness may be destroyed by countably closed forcing. We characterize the indestructibility of countable tightness under countably closed forcing by combinatorial statements similar to the ones Tall used to characterize…
We give, for some Borel sets of a product of two Polish spaces, including the Borel sets with countable sections, a Hurewicz-like characterization of those which cannot become a transfinite difference of open sets by changing the two Polish…