Related papers: Uniform first-order definitions in finitely genera…
We investigate the following problem: given a sample of classified strings, find a first-order sentence of minimal quantifier rank that is consistent with the sample. We represent strings as successor string structures, that is, finite…
We study the reactive synthesis problem for distributed systems with an unbounded number of participants interacting with an uncontrollable environment. Executions of those systems are modeled by data words, and specifications are given as…
We establish that all rings of $S$-integers are universally definable in function fields in one variable over certain ground fields including global and non-archimedean local fields. That is, we show that the complement of such a ring of…
Let $L$ be the language of rings. We provide an axiomatization of the $L$-theories of quaternions and octonions and characterize their models: they coincide, up to isomorphism, with quaternion and octonion algebras over a real closed field,…
Team Semantics generalizes Tarski's Semantics by defining satisfaction with respect to sets of assignments rather than with respect to single assignments. Because of this, it is possible to use Team Semantics to extend First Order Logic via…
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…
There exists an absolute constant $C$ with the following property. Let $A \subseteq \mathbb{F}_p$ be a set in the prime order finite field with $p$ elements. Suppose that $|A| > C p^{5/8}$. The set \[ (A \pm A)(A \pm A) = \{(a_1 \pm…
We consider the first-order theory of random variables with the probabilistic independence relation, which concerns statements consisting of random variables, the probabilistic independence symbol, logical operators, and existential and…
Semiring semantics evaluates logical statements by values in some commutative semiring K. Random semiring interpretations, induced by a probability distribution on K, generalise random structures, and we investigate here the question of how…
We identify a number of decidable and undecidable fragments of first-order concatenation theory. We also give a purely universal axiomatization which is complete for the fragments we identify. Furthermore, we prove some normal-form results.
A set $G \subseteq \omega$ is $n$-generic for a positive integer $n$ if and only if every $\Sigma^0_n$ formula of $G$ is decided by a finite initial segment of $G$ in the sense of Cohen forcing. It is shown here that every $n$-generic set…
We develop a first-order theory of ordered transexponential fields in the language $\{+,\cdot,0,1,<,e,T\}$, where $e$ and $T$ stand for unary function symbols. While the archimedean models of this theory are readily described, the study of…
From one point of view in the quantum theory of fields, free quantum fields are uniquely determined, not by field equations, but by the transformations of the field and the annihilation and creation operators from which the field is…
We show that a first-order sentence is almost surely true in a random group of density d<1/2 if and only if it is true in a non-abelian free group.
Let $k$ be a differential field of characteristic zero with an algebraically closed field of constants. In this article, we provide a classification of first order differential equations over $k$ and study the algebraic dependence of…
We prove, assuming resolution of singularities in positive characteristic, an analogue of Siegel's theorem on sum of squares in positive characteristic. The method of proof combines techniques from central simple algebras with model theory…
For any first order theory T we construct a Boolean valued model M, in which precisely the T--provable formulas hold, and in which every (Boolean valued) subset which is invariant under all automorphisms of M is definable by a first order…
We prove that for every ordered abelian group $G$ there exists a non-trivial ordered abelian group $H$ such that $G\preccurlyeq H\oplus G$ with the lexicographic order, and give a first-order characterization of ordered abelian group $G$…
The standard interpretation of first-order number theory (PA), according to the generally accepted view, associates well-defined set-theoretic entities with each and every well-formed formula of this system. But this implies that the class…
In this paper, first-order logic is interpreted in the framework of universal algebra, using the clone theory developed in three previous papers. We first define the free clone T(L, C) of terms of a first order language L over a set C of…