Related papers: There is no maximal decidable expansion of the $\l…

We show that the first-order logical theory of the binary overlap-free words (and, more generally, the ${\alpha}$-free words for rational ${\alpha}$, $2 < {\alpha} \leq 7/3$), is decidable. As a consequence, many results previously obtained…

Based on the work done in \cite{BV-Tind,DMS} in the o-minimal and geometric settings, we study expansions of models of a supersimple theory with a new predicate distiguishing a set of forking-independent elements that is dense inside a…

Recently, it was shown that any theory of strings containing the string-replace function (even the most restricted version where pattern/replacement strings are both constant strings) becomes undecidable if we do not impose some kind of…

We sow that there exists a generic extension of the G\"{o}del's constructible universe in which diamond holds and there exists a subset $Y \subseteq \omega_1$ such that for stationary many $\delta < \omega_1,$ the set $Y \cap \delta$ is not…

Let $\mathscr{S}$ be the class of all structures whose growth rate on orbits of subsets of size $n$ is not faster than $\frac{2^n}{p(n)}$ for any polynomial $p$. In this article we give a complete classification of all structures in…

The article continues the study of the genus of regular languages that the authors introduced in a 2012 paper. Generalizing a previous result, we produce a new family of regular languages on a two-letter alphabet having arbitrary high…

We argue that Godel's completeness theorem is equivalent to completability of consistent theories, and Godel's incompleteness theorem is equivalent to the fact that this completion is not constructive, in the sense that there are some…

Let $\mathcal M=\langle M, <, +, \dots\rangle$ be an o-minimal expansion of an ordered group, and $P\subseteq M$ a dense set such that certain tameness conditions hold. We introduce the notion of a `product cone' in $\widetilde{\mathcal…

In the realm of rank-metric codes, Maximum Rank Distance (MRD) codes are optimal algebraic structures attaining the Singleton-like bound. A major open problem in this field is determining whether an MRD code can be extended to a longer one…

Several properly countable unions of algebraic sets in $\mathbb{C}^n$ are definable in $\mathbb{C}(t)$ including the set CM of $j$-invariants of complex elliptic curves with complex multiplication. It has been suggested that one could prove…

We show that if $G$ is a sufficiently saturated stable group of finite weight with no infinite, infinite-index, chains of definable subgroups, then $G$ is superstable of finite $U$-rank. Combined with recent work of Palacin and Sklinos, we…

In the context of continuous first-order logic, special attention is often given to theories that are somehow continuous in an 'essential' way. A common feature of such theories is that they do not interpret any infinite discrete…

Let $(M,\scott X) \models \ACA$ be such that $P_\scott X$, the collection of all unbounded sets in $\scott X$, admits a definable complete ultrafilter and let $T$ be a theory extending first order arithmetic coded in $\scott X$ such that…

We study extensions of Sem\"enov arithmetic, the first-order theory of the structure $(\mathbb{N}, +, 2^x)$. It is well-knonw that this theory becomes undecidable when extended with regular predicates over tuples of number strings, such as…

We show that the ring of integers of $\mathbb{Q}^{\text{tr}}$ is existentially definable in the ring of integers of $\mathbb{Q}^{\text{tr}}(i)$, where $\mathbb{Q}^{\text{tr}}$ denotes the field of all totally real numbers. This implies that…

We define and study expansion problems on countable structures in the setting of descriptive combinatorics. We consider both expansions on countable Borel equivalence relations and on countable groups, in the Borel, measure and category…

The P versus NP problem is addressed in a context of provability and limitations on the possibility of finding sound axioms for formal theories. It is shown that if the term "constructible theory" is defined in a way which satisfies certain…

We show that the decidability of the first-order theory of the language that combines Boolean algebras of sets of uninterpreted elements with Presburger arithmetic operations. We thereby disprove a recent conjecture that this theory is…

We prove the validity of maximum principles for a class of fully nonlinear operators on unbounded subdomains $\Omega \subset \mathbb R^n$ of cylindrical type. The main structural assumption is the uniform ellipticity of the operator along…

We initiate an investigation of structures on the set of real numbers having the property that path components of definable sets are definable. All o\nobreakdash-\hspace{0pt}minimal structures on $(\mathbb{R},<)$ have the property, as do…