Related papers: Characterizing the existence of a Borel complete e…

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…

A space $G(M, \varPhi)$ of infinitely differentiable functions in ${\mathbb R}^n$ constructed with a help of a family $\varPhi=\{\varphi_m\}_{m=1}^{\infty}$ of real-valued functions $\varphi_m \in~C({\mathbb R}^n)$ and a logarithmically…

Given a Boolean algebra B and an embedding e:B -> P(N)/fin we consider the possibility of extending each or some automorphism of B to the whole P(N)/fin. Among other things, we show, assuming CH, that for a wide class of Boolean algebras…

The classical lemma of Borel reads: any power series with real coefficients is the Taylor series of a smooth function. Algebraically this means the surjectivity of the completion map at a point, $C^\infty(\Bbb{R}^n) \twoheadrightarrow…

An algebraically expandable (AE) class is a class of algebraic structures axiomatizable by sentences of the form $\forall \exists! \land p = q$. For a logic $L$ algebraized by a quasivariety $\mathcal{Q}$ we show that the AE-subclasses of…

We prove that the category $\mathsf{SBor}$ of standard Borel spaces is the (bi-)initial object in the 2-category of countably complete Boolean (countably) extensive categories. This means that $\mathsf{SBor}$ is the universal category…

The paper is in essence a survey of categories having $\phi$-weighted colimits for all the weights $\phi$ in some class $\Phi$. We introduce the class $\Phi^+$ of {\em $\Phi$-flat} weights which are those $\psi$ for which $\psi$-colimits…

We introduce the $\Sigma_1$-definable universal finite sequence and prove that it exhibits the universal extension property amongst the countable models of set theory under end-extension. That is, (i) the sequence is $\Sigma_1$-definable…

Let $X$ be a Polish space and $K$ a separable compact subset of the first Baire class on $X$. For every sequence $\bs$ dense in $\kk$, the descriptive set-theoretic properties of the set \[ \lbf=\{L\in[\nn]: (f_n)_{n\in L} \text{is…

We introduce the notion of finitary computable reducibility on equivalence relations on the natural numbers. This is a weakening of the usual notion of computable reducibility, and we show it to be distinct in several ways. In particular,…

J{\'o}nsson and Tarski's notion of the perfect extension of a Boolean algebra with operators has evolved into an extensive theory of canonical extensions of lattice-based algebras. After reviewing this evolution we make two contributions.…

We prove that for every Borel equivalence relation $E$, either $E$ is Borel reducible to $\mathbb{E}\_0$, or the family of Borel equivalence relations incompatible with $E$ has cofinal essential complexity. It follows that if $F$ is a Borel…

We consider definably complete and Baire expansions of ordered fields: every definable subset of the domain of the structure has a supremum and the domain can not be written as the union of a definable increasing family of nowhere dense…

In this paper we study extension problems for torsors in positive characteristic. Let $F$ be a field of characteristic $p>0$ and $U/F$ be a unipotent algebraic group. As our first main result, we prove that every $U$-torsor defined over the…

Let $G$ be an infinite locally compact abelian group. If $X$ is Banach space, we show that if every bounded Fourier multiplier $T$ on $L^2(G)$ has the property that $T\ot Id_X$ is bounded on $L^2(G,X)$ then the Banach space $X$ is…

We prove that the relation of bisimilarity between countable labelled transition systems is $\Sigma_1^1$-complete (hence not Borel), by reducing the set of non-wellorders over the natural numbers continuously to it. This has an impact on…

In [2] Su Gao proves that the following are equivalent for a countable $M$ (cf. theorem 1.2 too): (I)There is an uncountable model of the Scott sentence of $M$. (II) There exists some $j\in \overline{Aut(M)}\setminus Aut(M)$, where…

A non-deterministic automaton running on infinite trees is unambiguous if it has at most one accepting run on every tree. The class of languages recognisable by unambiguous tree automata is still not well-understood. In particular,…

For a class $\mathcal K$ of countable relational structures, a countable Borel equivalence relation $E$ is said to be $\mathcal K$-structurable if there is a Borel way to put a structure in $\mathcal K$ on each $E$-equivalence class. We…

We introduce the notions of a mutually algebraic structures and theories and prove many equivalents. A theory $T$ is mutually algebraic if and only if it is weakly minimal and trivial if and only if no model $M$ of $T$ has an expansion…