Related papers: When does every definable nonempty set have a defi…

Consider an expansion $\mathcal R=(R,<,+,\ldots)$ of an ordered divisible Abelian group of finite burden defining no nonempty subset $X$ of $R$ which is dense and codense in a definable open subset $U$ of $R$ with $X \subseteq U$. We…

We give a construction of a large first-order definable family of subrings of finitely generated fields $K$ of any characteristic. We deduce that for any such $K$ there exists a first-order sentence $\varphi_K$ characterising $K$ in the…

We prove that in some cases definable thin sets (including chains) of Borel partial orderings are necessarily countably cofinal. This includes the following cases: analytic thin sets, ROD thin sets in the Solovay model, and $\Sigma^1_2$…

We entirely classify definable sets up to definable bijections in $\mathbb{Z}$-groups, where the language is the one of ordered abelian groups. From this, we deduce, among others, a classification of definable families of bounded definable…

Definable stationary sets, and specifically, ordinal definable ones, play a significant role in the study of canonical inner models of set theory and the class HOD of hereditarily ordinal definable sets. Fixing a certain notion of…

We prove that in a continuous $\aleph_0$-stable theory every type-definable group is definable. The two main ingredients in the proof are: \begin{enumerate} \item Results concerning Morley ranks (i.e., Cantor-Bendixson ranks) from…

A variety V has definable factor congruences if and only if factor congruences can be defined by a first-order formula Phi having central elements as parameters. We prove that if Phi can be chosen to be existential, factor congruences in…

Orthogonality in model theory captures the idea of absence of non-trivial interactions between definable sets. We introduce a somewhat opposite notion of cohesiveness, capturing the idea of interaction among all parts of a given definable…

We say that a set is exhaustible if it admits algorithmic universal quantification for continuous predicates in finite time, and searchable if there is an algorithm that, given any continuous predicate, either selects an element for which…

We prove that in an arbitrary o-minimal structure, every interpretable group is definably isomorphic to a definable one. We also prove that every definable group lives in a cartesian product of one-dimensional definable group-intervals (or…

We continue investigating the structure of externally definable sets in NIP theories and preservation of NIP after expanding by new predicates. Most importantly: types over finite sets are uniformly definable; over a model, a family of…

Here it is shown that standard set theory can be interpreted in a theory about order. The ordering here is about non-extensional flat classes, i.e. classes that are not elements of classes. So, stipulating a nearly well order over all those…

Call a semantics for a language with variables absolute when variables map to fixed entities in the denotation. That is, a semantics is absolute when the denotation of a variable a is a copy of itself in the denotation. We give a trio of…

We show that every definable group G in an o-minimal structure is definably finitely generated. That is, G contains a finite subset that is not included in any proper definable subgroup. This provides another proof, and a generalization to…

For fragments L of first-order logic (FO) with counting quantifiers, we consider the definability problem, which asks whether a given L-formula can be equivalently expressed by a formula in some fragment of L without counting, and the more…

We consider d-minimal expansions of ordered fields. We demonstrate the existence of definable quotients of definable sets by definable equivalence relations when several technical conditions are satisfied. These conditions are satisfied…

We study the complexity of the classification problem for countable models of set theory (ZFC). We prove that the classification of arbitrary countable models of ZFC is Borel complete, meaning that it is as complex as it can conceivably be.…

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…

We introduce the o-minimal LS-category of definable sets in o-minimal expansions of ordered fields and we establish a relation with the semialgebraic and the classical one. We also study the o-minimal LS-category of definable groups. Along…

A simple criterion for a functor to be finitary is presented: we call $F$ finitely bounded if for all objects $X$ every finitely generated subobject of $FX$ factorizes through the $F$-image of a finitely generated subobject of $X$. This is…