Related papers: Theories of real addition with and without a predi…
Given a subset of $X\subseteq \mathbb{R}^{n}$ we can associate with every point $x\in \mathbb{R}^{n}$ a vector space $V$ of maximal dimension with the property that for some ball centered at $x$, the subset $X$ coincides inside the ball…
We show that if a first-order structure $\mathcal{M}$, with universe $\mathbb{Z}$, is an expansion of $(\mathbb{Z},+,0)$ and a reduct of $(\mathbb{Z},+,<,0)$, then $\mathcal{M}$ must be interdefinable with $(\mathbb{Z},+,0)$ or…
We prove that for any integers $\alpha, \beta > 1$, the existential fragment of the first-order theory of the structure $\langle \mathbb{Z}; 0,1,<, +, \alpha^{\mathbb{N}}, \beta^{\mathbb{N}}\rangle$ is decidable (where $\alpha^{\mathbb{N}}$…
We are going to prove that if the theory of a structure $\mathcal M=\langle \mathbb{N}, \Sigma \rangle$ is decidable and the standard order $<$ on natural numbers $\mathbb{N}$ is definable in $\mathcal M$, then there is a nontrivial…
In a relational language consisting of a single relation $ R, $ we investigate pseudofiniteness of certain Hrushovski constructions obtained via predimension functions. It is notable that the arity of the relation $ R $ plays a crucial role…
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…
The theory of addition in the domains of natural (N), integer (Z), rational (Q), real (R) and complex (C) numbers is decidable, so is the theory of multiplication in all those domains. By Godel's Incompleteness Theorem the theory of…
We develop a general ring theory in the o-minimal setting culminating in a description of all the definable rings in an arbitrary o-minimal structure. We show that every definably connected ring with non-trivial multiplication defines an…
We show that ${\mathbb Z}$ is definable in ${\mathbb Q}$ by a universal first-order formula in the language of rings. We also present an $\forall\exists$-formula for ${\mathbb Z}$ in ${\mathbb Q}$ with just one universal quantifier. We…
We prove that for an o-minimal expansion of the real additive group $\cal R$ and a set $P\subseteq \mathbb{R}$ of dimension $0$ such that $\langle\mathcal{R},P\rangle$ is sparse, has definable choice and every definable set has interior or…
In the present paper we discuss the lattice of reducts of $\langle \mathbb{Q}, \{$+$\} \rangle$
We study expansions of the Weak Monadic Second Order theory of (N,<) by cardinality relations, which are predicates R(X1,...,Xn) whose truth value depends only on the cardinality of the sets X1, ...,Xn. We first provide a (definable)…
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…
First-order logic fragments mixing quantifiers, arithmetic, and uninterpreted predicates are often undecidable, as is, for instance, Presburger arithmetic extended with a single uninterpreted unary predicate. In the SMT world, difference…
We prove model completeness for the theory of addition and the Frobenius map for certain subrings of rational functions in positive characteristic. More precisely: Let $p$ be a prime number, $\mathbb{F}_{p}$ the prime field with $p$…
The ordered structures of natural, integer, rational and real numbers are studied here. It is known that the theories of these numbers in the language of order are decidable and finitely axiomatizable. Also, their theories in the language…
We extend results of Videla and Fukuzaki to define algebraic integers in large classes of infinite algebraic extensions of Q and use these definitions for some of the fields to show the first-order undecidability. We also obtain a…
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…
The first-order theory of addition over the natural numbers, known as Presburger arithmetic, is decidable in double exponential time. Adding an uninterpreted unary predicate to the language leads to an undecidable theory. We sharpen the…
We prove the linear orders first-order definable in the standard model $(\ZZ;<,+)$ of Presburger arithmetic are exactly those that are $(\ZZ;<,+)$-definably embeddable into the lexicographic ordering on $\ZZ^n$ for some $n$.