Related papers: Linear Orders in Presburger Arithmetic

We present a new asynchronous model of computation named Stellar Resolution based on first-order unification. This model of computation is obtained as a formalisation of Girard's transcendental syntax programme, sketched in a series of…

Let $G$ be a model of Presburger arithmetic. Let $\mathcal{L}$ be an expansion of the language of Presburger $\mathcal{L}_{Pres}$. In this paper we prove that the $\mathcal{L}$-theory of $G$ is $\mathcal{L}_{Pres}$-minimal iff it has the…

Let $P^+(n)$ denote the largest prime of the integer $n$. Using the \begin{align*}\Psi\_{F\_1\cdots F\_t}\left(\mathcal{K}\cap[-N,N]^d,N^{1/u}\right):=\\#\left\{\mathcal{K}\in…

During the last decades, a lot of effort was put into identifying decidable fragments of first-order logic. Such efforts gave birth, among the others, to the two-variable fragment and the guarded fragment, depending on the type of…

A prefix grammar is a context-free grammar whose nonterminals generate prefix-free languages. A prefix grammar $G$ is an ordinal grammar if the language $L(G)$ is well-ordered with respect to the lexicographic ordering. It is known that…

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…

We show that the existence of a first-order formula separating two monadic second order formulas over countable ordinal words is decidable. This extends the work of Henckell and Almeida on finite words, and of Place and Zeitoun on…

Recently, symbolic structures were proposed as finite representations of potentially infinite first-order structures, where Linear Integer Arithmetic terms and formulas define the domain and interpretations of a structure. We generalize…

We show that a wide class of $W$-(super)algebras, including $W_N^{(N-1)}$, $U(N)$-superconformal as well as $W_N$ nonlinear algebras, can be linearized by embedding them as subalgebras into some {\em linear} (super)conformal algebras with…

This paper provides an NP procedure that decides whether a linear-exponential system of constraints has an integer solution. Linear-exponential systems extend standard integer linear programs with exponential terms $2^x$ and remainder terms…

A planar order is a special linear extension of the edge poset (partially ordered set) of a processive plane graph. The definition of a planar order makes sense for any finite poset and is equivalent to the one of a conjugate order. Here it…

Using geometric methods for linearizing systems of second order cubically semi-linear ordinary differential equations, we extend to the third order by differentiating the second order equation. This yields criteria for linearizability of a…

Let $(\Omega, \leq)$ be a totally ordered set. We prove that if $\Aut(\Omega,\leq)$ is transitive and satisfies the same first-order sentences as $\Aut(\RR,\leq)$ (in the language of lattice-ordered groups) then $\Omega$ and $\RR$ are…

A {\it Cameron -- Liebler line class} ${\cal L}$ with parameter $x$ is a set of lines of projective geometry $PG(3,q)$ such that each line of ${\cal L}$ meets exactly $x(q+1)+q^2-1$ lines of ${\cal L}$ and each line that is not from ${\cal…

Prime-based ordering which is proved to be admissible, is the encoding of indeterminates in power-products with prime numbers and ordering them by using the natural number order. Using Eiffel, four versions of Buchberger's improved…

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…

Uniform preorders are a class of combinatory representations of Set-indexed preorders that generalize Pieter Hofstra's basic relational objects. An indexed preorder is representable by a uniform preorder if and only if it has as generic…

Recent work on loglinear models in probabilistic constraint logic programming is applied to first-order probabilistic reasoning. Probabilities are defined directly on the proofs of atomic formulae, and by marginalisation on the atomic…

Let $(M,\scott X) \models \ACA$ be such that $P_\scott X$, the collection of all unbounded sets in $\scott X$, admits a definable complete ultrafilter and let $T$ be a theory extending first order arithmetic coded in $\scott X$ such that…

We give explicit expressions for \vSapovalov elements in Type A Lie algebras and superalgebras. Explicit expressions were already given in arXiv:1710.10528 Section 9, using non-commutative determinants, and in fact our first main results,…