Related papers: There is no maximal decidable expansion of the $\l…
We study H-structures associated to SU-rank 1 measurable structures. We prove that the SU-rank of the expansion is continuous and that it is uniformly definable in terms of the parameters of the formulas. We also introduce notions of…
In this paper, we show that for a fixed rank $n$, there are only finitely many $m$ for which there is a regular $m$-gonal form of rank $n$ and determine every type of the (generalized) regular $m$-gonal form for every sufficiently large…
Many interesting geometric structures can be described as regular infinitesimal flag structures, which occur as the underlying structures of parabolic geometries. Among these structures we have for instance conformal structures, contact…
An expansion of a definably complete field either defines a discrete subring, or the image of a definable discrete set under a definable map is nowhere dense. As an application we show a definable version of Lebesgue's differentiation…
It is proved that the first-order theory of the structure (N,mod) is undecidable. Here mod denotes the operation of computing the remainder for any division between positive integers; i.e. x mod y is the remainder obtained by the division x…
We consider extensions of monadic second order logic over $\omega$-words, which are obtained by adding one language that is not $\omega$-regular. We show that if the added language $L$ has a neutral letter, then the resulting logic is…
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…
We study the question of whether a given regular language of finite trees can be defined in first-order logic. We develop an algebraic approach to address this question and we use it to derive several necessary and sufficient conditions for…
Answering a question of Junker and Ziegler, we construct a countable first order structure which is not omega-categorical, but does not have any proper non-trivial reducts, in either of two senses (model-theoretic, and group-theoretic). We…
We establish the decidability of the $\Sigma_2$ theory of both the arithmetic and hyperarithmetic degrees in the language of uppersemilattices i.e. the language with $\leq, 0$ and $\sqcup$. This is achieved by using Kumabe-Slaman forcing -…
Let M be ternary, homogeneous and simple. We prove that if M is finitely constrained, then it is supersimple with finite SU-rank and dependence is $k$-trivial for some $k < \omega$ and for finite sets of real elements. Now suppose that, in…
We demonstrate the following uniform local definable cell decomposition theorem in this paper. Consider a structure $\mathcal M = (M, <,0,+, \ldots)$ elementarily equivalent to a locally o-minimal expansion of the group of reals $(\mathbb…
A countable structure is said to be extendible if it has the same Scott sentence as some uncountable structure. Rigid structures are not extendible. We give an example of an extendible model with a rigid elementary extension.
We consider first-order logics of sequences ordered by the subsequence ordering, aka sequence embedding. We show that the \Sigma_2 theory is undecidable, answering a question left open by Kuske. Regarding fragments with a bounded number of…
Cantor's ordinal numbers, a powerful extension of the natural numbers, are a cornerstone of set theory. They can be used to reason about the termination of processes, prove the consistency of logical systems, and justify some of the core…
In this note, we present a characterization of sets definable in Skolem arithmetic, i.e., the first-order theory of natural numbers with multiplication. This characterization allows us to prove the decidability of the theory. The idea is…
Suppose $E \subseteq \mathbb{R}$ is nowhere dense. If $(\mathbb{R},<,+,(x \mapsto \lambda x)_{\lambda \in \mathbb{R} }, E)$ does not define every bounded Borel subset of every $\mathbb{R}^n$ then for every $s > 0$ we have $$ | \{ k \in…
Diekert, Matiyasevich and Muscholl proved that the existential first-order theory of a trace monoid over a finite alphabet is decidable. We extend this result to a natural class of trace monoids with infinitely many generators. As an…
Thamrongthanyalak demonstrated a definable version of Michael's selection theorem in d-minimal expansions of the real field. We generalize this result to the case in which the structures are d-minimal expansions of ordered fields $\mathcal…
We introduce a first-order theory of finite full binary trees and then identify decidable and undecidable fragments of this theory. We show that the analogue of Hilbert`s 10th Problem is undecidable by constructing a many-to-one reduction…