Related papers: First-Order Concatenation Theory with Bounded Quan…

We consider entailment problems involving powerful constraint languages such as frontier-guarded existential rules in which we impose additional semantic restrictions on a set of distinguished relations. We consider restricting a relation…

Validation is a major challenge in differentiable programming. The state of the art is based on algorithmic differentiation. Consistency of first-order tangent and adjoint programs is defined by a well-known first-order differential…

Following the lines of the analysis done in [BPZ07, BCF07] for first-order G\"odel logics, we present an analogous investigation for Nilpotent Minimum logic NM. We study decidability and reciprocal inclusion of various sets of first-order…

We consider cut-elimination in the sequent calculus for classical first-order logic. It is well known that this system, in its most general form, is neither confluent nor strongly normalizing. In this work we take a coarser (and…

We study the second bounded cohomology of an amalgamated free product of groups, and an HNN extension of a group. As an application, we have a group with infinitely many ends has infinite dimensional second bounded cohomology.

We show that for quasivarieties of p-algebras the properties of (i) having decidable first-order theory and (ii) having decidable first-order theory of the finite members, coincide. The only two quasivarieties with these properties are the…

A relevant thesis is that for the family of complete first order theories with NIP (i.e. without the independence property) there is a substantial theory, like the family of stable (and the family of simple) first order theories. We examine…

We consider the problem of counting the number of answers to a first-order formula on a finite structure. We present and study an extension of first-order logic in which algorithms for this counting problem can be naturally and conveniently…

We classify the stable formulas in the theory of Dense Linear Orders without endpoints, the stable formulas in the theory of Divisible Abelian Groups, and the stable formulas without parameters in the theory of Real Closed Fields. The third…

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 study the collection of first-order logical schemata all of whose instances are theorems of a given theory $T$; we call these the validities of $T$ ($\mathsf{V}(T)$). It is easy to see that if $T$ is a decidable theory, then…

First-order logic is the basis for many knowledge representation formalisms and methods. Providing technological support for learning to write first-order formulas for natural language specifications requires methods to test formulas for…

We estimate, in a number field, the number of elements and the maximal number of linearly independent elements, with prescribed bounds on their valuations. As a by-product, we obtain new bounds for the successive minima of ideal lattices.…

We investigate the theory of finite observables, i.e., resolutions of the finite-dimensional identity by means of positive operators, that have a physical interpretation in terms of measurement schemes. We focus on extremal and rank-one…

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…

We study finite first-order satisfiability (FSAT) in the constructive setting of dependent type theory. Employing synthetic accounts of enumerability and decidability, we give a full classification of FSAT depending on the first-order…

We study semantic and syntactic properties of spherical orders and their elementary theories, including finite and dense orders and their theories. It is shown that theories of dense $n$-spherical orders are countably categorical and…

We establish the boundedness character of solutions of a system of rational difference equations with a variable coefficient

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…

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…