ﻻ يوجد ملخص باللغة العربية
We develop general machinery to cast the class of potential canonical Scott sentences of an infinitary sentence $Phi$ as a class of structures in a related language. From this, we show that $Phi$ has a Borel complete expansion if and only if $S_infty$ divides $Aut(M)$ for some countable model $Mmodels Phi$. Using this, we prove that for theories $T_h$ asserting that ${E_n}$ is a countable family of cross cutting equivalence relations with $h(n)$ classes, if $h(n)$ is uniformly bounded then $T_h$ is not Borel complete, providing a converse to Theorem~2.1 of cite{LU}.
We study the extension of the Kechris-Solecki-Todorcevic dichotomy on analytic graphs to dimensions higher than 2. We prove that the extension is possible in any dimension, finite or infinite. The original proof works in the case of the finite dimens
We prove that, for any natural number n $ge$ 1, we can find a finite alphabet $Sigma$ and a finitary language L over $Sigma$ accepted by a one-counter automaton, such that the $omega$-power L $infty$ := {w 0 w 1. .. $in$ $Sigma$ $omega$ | $forall$i $
We give a completely constructive solution to Tarskis circle squaring problem. More generally, we prove a Borel version of an equidecomposition theorem due to Laczkovich. If $k geq 1$ and $A, B subseteq mathbb{R}^k$ are bounded Borel sets with the sa
We provide dichotomy results characterizing when two disjoint analytic binary relations can be separated by a countable union of ${bfSigma}^0_1 !times! {bfSigma}^0_xi$ sets, or by a ${bfPi}^0_1 !times! {bfPi}^0_xi$ set.
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 when all the equ