Related papers: There is no maximal decidable expansion of the $\l…
Let $\mathcal{O}$ be a maximal order in the quaternion algebra over $\mathbb{Q}$ ramified at $p$ and $\infty$. We prove two theorems that allow us to recover the structure of $\mathcal{O}$ from limited information. The first says that for…
Tarski initiated a logic-based approach to formal geometry that studies first-order structures with a ternary betweenness relation \beta, and a quaternary equidistance relation \equiv. Tarski established, inter alia, that the first-order…
A visceral structure on M is given by a definable base for a uniform topology on its universe in which all basic open sets are infinite and any infinite definable subset X of M has non-empty interior. This context includes o-minimal ordered…
We determine the sets definable in expansions of the ordered real additive group by generalized Cantor sets. Given a natural number $r\geq 3$, we say a set $C$ is a generalized Cantor set in base $r$ if there is a non-empty…
We study the complexity of automatic structures via well-established concepts from both logic and model theory, including ordinal heights (of well-founded relations), Scott ranks of structures, and Cantor-Bendixson ranks (of trees). We…
We show that the first-order theory of structural subtyping of non-recursive types is decidable. Let $\Sigma$ be a language consisting of function symbols (representing type constructors) and $C$ a decidable structure in the relational…
We consider the logic MSO+U, which is monadic second-order logic extended with the unbounding quantifier. The unbounding quantifier is used to say that a property of finite sets holds for sets of arbitrarily large size. We prove that the…
We prove that $(\Z,+,0)$ has no proper superstable expansions of finite Lascar rank. Nevertheless, this structure equipped with a predicate defining powers of a given natural number is superstable of Lascar rank $\omega$. Additionally, our…
Tarski initiated a logic-based approach to formal geometry that studies first-order structures with a ternary betweenness relation (\beta) and a quaternary equidistance relation (\equiv). Tarski established, inter alia, that the first-order…
We investigate the decidability of the monadic second-order (MSO) theory of the structure $\langle \mathbb{N};<,P_1, \ldots,P_d \rangle$, for various unary predicates $P_1,\ldots,P_d \subseteq \mathbb{N}$. We focus in particular on…
Let M be an o-minimal structure with elimination of imaginaries, N an unstable structure definable in M. Then there exists X, interpretable in N, such that X with all the structure induced from N is o-minimal. In particular X is linearly…
Let $M$ be a fine structural mouse and let $F\in M$ be such that $M\models$``$F$ is a total extender'' and $(M||\mathrm{lh}(F),F)$ is a premouse. We show that it follows that $F\in\mathbb{E}^M$, where $\mathbb{E}^M$ is the extender sequence…
We study the definability of maximal towers and of inextendible linearly ordered towers (ilt's), a notion that is more general than that of a maximal tower. We show that there is, in the constructible universe, a $\Pi^1_1$ definable maximal…
We consider first-order logic over the subword ordering on finite words, where each word is available as a constant. Our first result is that the $\Sigma_1$ theory is undecidable (already over two letters). We investigate the decidability…
We calculate the possible Scott ranks of countable models of Peano arithmetic. We show that no non-standard model can have Scott rank less than $\omega$ and that non-standard models of true arithmetic must have Scott rank greater than…
Suppose that $\Omega$ is a complex lattice that is closed under complex conjugation and that $I$ is a small real interval, and that $D$ is a disc in $ \mathbb{C}$. Then the restriction $\wp|_D$ is definable in the structure…
In a constructive setting, no concrete formulation of ordinal numbers can simultaneously have all the properties one might be interested in; for example, being able to calculate limits of sequences is constructively incompatible with…
It is known that the theory of any class of normed spaces over the reals that includes all spaces of a given dimension d > 1 is undecidable, and indeed, admits a relative interpretation of second-order arithmetic. The notion of a normed…
Let $G$ be a finite group and $K$ a normal subset consisting of odd-order elements. The rational closure of $K$, denoted $\mathbf D_K$, is the set of elements $x \in G$ with the property that $\langle x \rangle = \langle y \rangle$ for some…
We study the structure of infinite discrete sets D definable in expansions of ordered Abelian groups whose theories are strong and definably complete, with particular emphasis on the set D' comprised of differences between successive…