Related papers: On the equivalence of two quantifier elimination t…
We introduce a modification of standard Martin-Lof type theory in which we eliminate definitional equality and replace all computation rules by propositional equalities. We show that type checking for such a system can be done in quadratic…
We study the relation of two frameworks for multiplicative homotopy theories: Presentably symmetric monoidal $\infty$-categories and combinatorial symmetric monoidal model categories. Our main theorem establishes an equivalence of their…
Two constructions of a Lie model of the interval were performed by R. Lawrence and D. Sullivan. The first model uses an inductive process and the second one comes directly from solving a differential equation. They conjectured that these…
We show that if for any two elementary equivalent structures $\mathbf{M}, \mathbf{N}$ of size at most continuum in a countable language, $\mathbf{M}^{\omega}/ \mathcal{U} \simeq \mathbf{N}^\omega / \mathcal{U}$ for some ultrafilter…
We consider one-round games between a classical verifier and two provers who share entanglement. We show that when the constraints enforced by the verifier are `unique' constraints (i.e., permutations), the value of the game can be well…
The study of equality types is central to homotopy type theory. Characterizing these types is often tricky, and various strategies, such as the encode-decode method, have been developed. We prove a theorem about equality types of…
Using the path-integral approach, the quantum massive Thirring and sine-Gordon models are proven to be equivalent at finite temperature. This result is an extension of Coleman's proof of the equivalence between both theories at zero…
We modify the quantization of Etingof and Kazhdan so that it can be used to quantize quasi-Lie bialgebras.
In answer set programming, two groups of rules are considered strongly equivalent if they have the same meaning in any context. Strong equivalence of two programs can be sometimes established by deriving rules of each program from rules of…
We give a sufficient condition for quantising integrable systems.
Tests are essential in Information Retrieval (IR), in order to evaluate the effectiveness of a query. Tests intended to exhibit the sense of words in con-text were undertaken and linked with Quantum Mechanics (QM). Poll tests were…
We review both the construction of conformal blocks in quantum Liouville theory and the quantization of Teichm\"uller spaces as developed by Kashaev, Checkov and Fock. In both cases one assigns to a Riemann surface a Hilbert space acted on…
Quantifier elimination over the reals is a central problem in computational real algebraic geometry, polynomial system solving and symbolic computation. Given a semi-algebraic formula (whose atoms are polynomial constraints) with…
A unified Gentzen-style framework for until-free propositional linear-time temporal logic is introduced. The proposed framework, based on infinitary rules and rules for primitive negation, can handle uniformly both a single-succedent…
Running verification tasks in database driven systems requires solving quantifier elimination problems of a new kind. These quantifier elimination problems are related to the notion of a cover introduced in ESOP 2008 by Gulwani and…
The $\epsilon$-logic (which is called $\epsilon$E-logic in this paper) of Kuyper and Terwijn is a variant of first order logic with the same syntax, in which the models are equipped with probability measures and in which the $\forall x$…
The equivalence test is a main part in any classification problem. It helps to prove bounds for the main parameters of the considered combinatorial structures and to study their properties. In this paper, we present algorithms for…
A general method is developed for deriving Quantum First and Second Fundamental Theorems of Coinvariant Theory from classical analogs in Invariant Theory, in the case that the quantization parameter q is transcendental over a base field.…
Recently a problem concerning the equivalence of joint measurability and coexistence of quantum observables was solved [15]. In this paper we generalize two known joint measurability results from sharp observables to the class of extreme…
Elementary proofs are given for sums of Schur functions over partitions into at most n parts each less than or equal to m for which i) all parts are even, ii) all parts of the conjugate partition are even. Also, an elementary proof of a…