Related papers: From Strong Amalgamability to Modularity of Quanti…
The concept of a modular value of an observable of a pre- and post-selected quantum system is introduced. It is similar in form and in some cases has a close connection to the weak value of an observable, but instead of describing an…
This is a survey on propositional proof complexity aimed at introducing the basics of the field with a particular focus on a method known as feasible interpolation. This method is used to construct "hard theorems" for several proof systems…
In this paper we describe how to leverage higher-order unification to type check a dependently typed language with meta-variables. The literature usually presents the unification algorithm as a standalone component, however the need to…
We consider the problem of obtaining interpolation constraints for function classes, i.e., necessary and sufficient constraints that a set of points, function values and (sub)gradients must satisfy to ensure the existence of a global…
The present paper studies the existence of valuative interpolation on the local ring of an irreducible analytic subvariety at singular points. We firstly develop the concepts and methods of Zhou weights and Tian functions near singular…
Uniform interpolation properties are defined for equational consequence in a variety of algebras and related to properties of compact congruences on first the free and then the finitely presented algebras of the variety. It is also shown,…
Quantifier elimination (QE) and Craig interpolation (CI) are central to various state-of-the-art automated approaches to hardware and software verification. They are rooted in the Boolean setting and are successful for, e.g., first-order…
The aim of this work is to show how we can decompose a module (if decomposable) into an indecomposable module with the help of the minimization process.
In this paper, we show that the monomial basis is generally as good as a well-conditioned polynomial basis for interpolation, provided that the condition number of the Vandermonde matrix is smaller than the reciprocal of machine epsilon.…
We present the notions of positively complete theory and general forms of amalgamation in the framework of positive logic. We explore the fundamental properties of positively complete theories and study the behaviour of companion theories…
Properties of Term Rewriting Systems are called modular iff they are preserved under (and reflected by) disjoint union, i.e. when combining two Term Rewriting Systems with disjoint signatures. Convergence is the property of Infinitary Term…
Tomita-Takesaki modular theory provides a set of algebraic tools in quantum field theory that is suitable for the study of the information-theoretic properties of states. For every open set in spacetime and choice of two states, the modular…
This paper assumes a robust, in general not dominated, probabilistic framework and provides necessary and sufficient conditions for a bipolar representation of subsets of the set of all quasi-sure equivalence classes of non-negative random…
In \cite{Craig}, we introduced a syntactically defined and highly general class of calculi known as \emph{semi-analytic}. We then demonstrated that any sufficiently strong (modal) substructural logic with a semi-analytic calculus must…
In the Nelson-Oppen combination method for satisfiability modulo theories, the combined theories must be stably infinite; in gentle combination, one theory has to be gentle, and the other has to satisfy a similar yet weaker property; in…
Selective rationalization has become a common mechanism to ensure that predictive models reveal how they use any available features. The selection may be soft or hard, and identifies a subset of input features relevant for prediction. The…
Let $A$ be a finite-dimensional algebra over an algebraically closed field $\Bbbk$. For any finite-dimensional $A$-module $M$ we give a general formula that computes the indecomposable decomposition of $M$ without decomposing it, for which…
In this letter, we present a new procedure to determine completely the complex modular values of arbitrary observables of pre- and post-selected ensembles, which works experimentally for all measurement strengths and all post-selected…
We prove that the integral closedness of any ideal of height at least two is compatible with specialization by a generic element. This opens the possibility for proofs using induction on the height of an ideal. Also, with additional…
We define a logical framework with singleton types and one universe of small types. We give the semantics using a PER model; it is used for constructing a normalisation-by-evaluation algorithm. We prove completeness and soundness of the…