Related papers: Quantifier-free descriptions for quantifier soluti…
Quantum relations in the sense of Weaver are $M'$-bimodules, for a von Neumann algebra $M$, these generalising actual relations on a set $X$ when $M=\ell^\infty(X)$. Similarly, relations between two sets can be generalised as bimodules over…
Let $A$ be a set of $N$ vectors in ${\mathbb Z}^n$ and let $v$ be a vector in ${\mathbb C}^N$ that has minimal negative support for $A$. Such a vector $v$ gives rise to a formal series solution of the $A$-hypergeometric system with…
Covariant, self-interacting scalar quantum field theories admit solutions for low enough spacetime dimensions, but when additional divergences appear in higher dimensions, the traditional approach leads to results, such as triviality, that…
Inspired by Karr's algorithm, we consider the summations involving a sequence satisfying a recurrence of order two. The structure of such summations provides an algebraic framework for solving the difference equations of form…
Parametric linear systems are linear systems of equations in which some symbolic parameters, that is, symbols that are not considered to be candidates for elimination or solution in the course of analyzing the problem, appear in the…
Let $A$ be a set of $N$ vectors in ${\mathbb Z}^n$ and let $v$ be a vector in ${\mathbb C}^N$ that has minimal negative support for $A$. Such a vector $v$ gives rise to a formal series solution of the $A$-hypergeometric system with…
The quantified constraint satisfaction problem (QCSP) is the problem of deciding, given a structure and a first-order prenex sentence whose quantifier-free part is the conjunction of atoms, whether or not the sentence holds on the…
This article contains ideas and their elaboration for quantifiers, which appeared after checking in practice the experimental language of the formal knowledge representation YAFOLL [1]: - looking at for_all and exists quantifiers as…
Intervals in binary or n-ary relations or other discrete structures generalize the concept of interval in a linearly ordered set. Join-irreducible partitions into intervals are characterized in the lattice of all interval decompositions of…
We propose a system for the interpretation of anaphoric relationships between unbound pronouns and quantifiers. The main technical contribution of our proposal consists in combining generalized quantifiers with dependent types. Empirically,…
A number of models of linear logic are based on or closely related to linear algebra, in the sense that morphisms are "matrices" over appropriate coefficient sets. Examples include models based on coherence spaces, finiteness spaces and…
We consider a system of linear equations, whose coefficients depend linearly on interval parameters. Its solution set is defined as the set of all solutions of all admissible realizations of the parameters. We study unbounded directions of…
We investigate the isomorphism problem in the setting of definable sets (equivalent to sets with atoms): given two definable relational structures, are they related by a definable isomorphism? Under mild assumptions on the underlying…
The issue of gauge invariances in the sigma model formalism is discussed at the free and interacting level. The problem of deriving gauge invariant interacting equations can be addressed using the proper time formalism. This formalism is…
We build on our previous paper \cite{constructive} by using the general method introduced there in conjunction with invariant theory. This yields quantifier elimination results for the classical quaternions, octonions, as well as other…
We provide axiomatization and relative quantifier elimination for valued fields equipped with an automorphism, in residue characteristic zero. Similar results are known under strong assumptions on the interaction between the automorphism…
Given an algebra A, presented by generators and relations, i.e. as a quotient of a tensor algebra by an ideal, we construct a free algebra resolution of A, i.e. a differential graded algebra which is quasi-isomorphic to A and which is…
We obtain quantitative estimates for the asymptotic density of subsets of the two-dimensional integer lattice which contain only trivial solutions to an additive equation involving binary forms. In the process we develop an analogue of…
This paper deals with solution of inequality $\textbf{A}\otimes \textbf{x}\preceq \textbf{b}$, where $\textbf{A}, \textbf{x}$ and $\textbf{b}$ are interval matrices with entries defined over idempotent semiring. It deals also with the…
We investigate quantifier alternation hierarchies in first-order logic on finite words. Levels in these hierarchies are defined by counting the number of quantifier alternations in formulas. We prove that one can decide membership of a…