Related papers: There is no maximal decidable expansion of the $\l…
The satisfiability problem for SPARQL patterns is undecidable in general, since the expressive power of SPARQL 1.0 is comparable with that of the relational algebra. The goal of this paper is to delineate the boundary of decidability of…
It is well known that the R, the set of real numbers, is an abstract set, where almost all its elements cannot be described in any finite language. We investigate possible approaches to what might be called an epi-constructionist approach…
The Pila-Wilkie theorem states that if a set $X\subseteq \mathbb R^n$ is definable in an o-minimal structure $\mathcal R$ and contains `many' rational points, then it contains an infinite semialgebraic set. In this paper, we extend this…
In the folklore of linear logic, a common intuition is that the structure of finiteness spaces, introduced by Ehrhard, semantically reflects the strong normalization property of cut-elimination. We make this intuition formal in the context…
We define a logic of propositional formula schemata adding to the syntax of propositional logic indexed propositions and iterated connectives ranging over intervals parameterized by arithmetic variables. The satisfiability problem is shown…
Maximal Orders over an algebra are a generalization of the concept of a Dedekind domain. The definition given in Maximal Orders by Reiner, assumes that the field over which the algebra is defined is in the center of the order. Since we want…
We show that there is no theory that is minimal with respect to interpretability among recursively enumerable essentially undecidable theories.
We use a generalization of a construction by Ziegler to show that for any field $F$ and any countable collection of countable subsets $A_i \subseteq F, i \in \calI \subset \Z_{>0}$ there exist infinitely many fields $K$ of arbitrary…
For which unary predicates $P_1, \ldots, P_m$ is the MSO theory of the structure $\langle \mathbb{N}; <, P_1, \ldots, P_m \rangle$ decidable? We survey the state of the art, leading us to investigate combinatorial properties of…
We consider an almost o-minimal expansion of an ordered group $\mathcal M=(M,<,+,0,\ldots)$ and its tame extension $\mathcal N=(N,<,+,0,\ldots)$. We demonstrate that the subset $\{x \in M^n\;|\; \mathcal N \models \Phi(x,a)\}$ of $M^n$…
Let $\RR_S$ denote the expansion of the real ordered field by a family of real-valued functions $S$, where each function in $S$ is defined on a compact box and is a member of some quasianalytic class which is closed under the operations of…
We prove that the existential theory of any function field $K$ of characteristic $p> 0$ is undecidable in the language of rings provided that the constant field does not contain the algebraic closure of a finite field. We also extend the…
The maximum extensions of finite-dimensional nilpotent Lie algebras are considered. In particular, it is proved that in the general case such an extension is not unique, which refutes one L. Snoble's assumption.
Let $T$ be a complete, model-complete, geometric dp-minimal $\mathcal{L}$-theory of topological fields of characteristic $0$ and let $T(\partial)$ be the theory of expansions of models of $T$ by a derivation $\partial$. We assume that…
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 define two families of expansions of $(\mathbb{Z},+,0)$ by unary predicates, and prove that their theories are superstable of $U$-rank $\omega$. The first family consists of expansions $(\mathbb{Z},+,0,A)$, where $A$ is an infinite…
Let $\RR_S$ denote the expansion of the real ordered field by a family of real-valued functions $S$, where each function in $S$ is defined on a compact box and is a member of some quasianalytic class which is closed under the operations of…
We study definable sets $D$ of SU-rank 1 in $M^{eq}$, where $M$ is a countable homogeneous and simple structure in a language with finite relational vocabulary. Each such $D$ can be seen as a `canonically embedded structure', which inherits…
We present a concept of uniform encodability of theories and develop tools related to this concept. As an application we obtain general undecidability results which are uniform for large families of structures. In the way, we define…
A theory $T$ is said to be relatively decidable if for every model of $T$, one can compute the elementary diagram of that model from its atomic diagram together with $T$. We verify a conjecture of Chubb, Miller, and Solomon by showing that…