Related papers: Uniform first-order definitions in finitely genera…

We provide a sufficient condition for a polynomial ring, not necessarily commutative, to have a first-order definition for the rational integers.

We show that the isomorphy type of every finitely generated field $K$ with $\chr(K)\neq2$ is encoded by a \textit{\textbf{single\ha3explicit\ha3axiom}} $\istp K\!$ \textit{\textbf{in\ha3the\ha3language\ha3of\ha3fields}}, i.e., for all…

We consider first-order definability and decidability questions over rings of integers of algebraic extensions of $\Q$, paying attention to the uniformity of definitions. The uniformity follows from the simplicity of our first-order…

First order formulas in a relational signature can be considered as operations on the relations of an underlying set, giving rise to multisorted algebras we call first order algebras. We present universal axioms so that an algebra satisfies…

We introduce and study a natural class of fields in which certain first-order definable sets are existentially definable, and characterise this class by a number of equivalent conditions. We show that global fields belong to this class, and…

We show that rings of $S$-integers of a global function field $K$ of odd characteristic are first-order universally definable in $K$. This extends work of Koenigsmann and Park who showed the same for $\mathbb{Z}$ in $\mathbb{Q}$ and the…

First-order learning involves finding a clause-form definition of a relation from examples of the relation and relevant background information. In this paper, a particular first-order learning system is modified to customize it for finding…

This paper discusses the method of formative rules for first-order term rewriting, which was previously defined for a higher-order setting. Dual to the well-known usable rules, formative rules allow dropping some of the term constraints…

We study two general approaches how to describe spin one particles, using vector and antisymmetric tensor fields within RChT. In this paper we focus on the question of an equivalence of both ways. The appearing problems lead us to the…

In Team Semantics, a dependency notion is strongly first order if every sentence of the logic obtained by adding the corresponding atoms to First Order Logic is equivalent to some first order sentence. In this work it is shown that all…

Let G be an algebraic group defined over an algebraically closed field k of characteristic zero. We give a simple proof of the following result: if H^1(L, G) = {1} for some finitely generated field extension L/k of transcendence degree \ge…

We prove that the first-order theory of any function field K of characteristic p>2 is undecidable in the language of rings without parameters. When K is a function field in one variable whose constant field is algebraic over a finite field,…

In this paper, we show that a partitioned formula \phi is dependent if and only if \phi has uniform definability of types over finite partial order indiscernibles. This generalizes our result from a previous paper [1]. We show this by…

Various feature descriptions are being employed in logic programming languages and constrained-based grammar formalisms. The common notational primitive of these descriptions are functional attributes called features. The descriptions…

Let $F_p$ be the field of a prime order $p$. Then for any positive integer $n>1$, for any $\epsilon>0$, and for any subset $A$ of $F_p$, every element of $F_p$ can be represented as a sum of $N$ elements, each of them is a product of $n$…

We consider the first order formalism in string theory, providing a new off-shell description of the nontrivial backgrounds around an "infinite metric". The OPE of the vertex operators, corresponding to the background fields in some…

We axiomatize the first-order theories of exponential integer parts of real-closed exponential fields in a language with $2^x$, in a language with a predicate for powers of 2, and in the basic language of ordered rings. In particular, the…

We show that the decidability of the first-order theory of the language that combines Boolean algebras of sets of uninterpreted elements with Presburger arithmetic operations. We thereby disprove a recent conjecture that this theory is…

We give a simple new proof that regular languages defined by first-order sentences with no quantifier alteration can be defined by such sentences in which only regular atomic formulas appear. Earlier proofs of this fact relied on arguments…

Every subfield $\kk(\phi)$ of the field of rational functions $\kk(x_1,...,x_n)$ is contained in a unique maximal subfield of the form $\kk(\psi)$. The element $\psi$ is called generative for the element $\phi$. A subfield of…