Related papers: Formalizing Constructive Quantifier Elimination in…
Let $(g,\delta_\hbar)$ be a Lie bialgebra. Let $(U_\hbar(g),\Delta_\hbar)$ a quantization of $(g,\delta_\hbar)$ through Etingof-Kazhdan functor. We prove the existence of a $L_\infty$-morphism between the Lie algebra $C(\g)=\Lambda(g)$ and…
We use generalized Taylor formulae in order to give some simple constructions in the real closure of an \ovfz. We deduce a new, simple quantifier elimination algorithm for \rcvfs and some theorems about constructible subsets of real…
To ensure decidability and consistency of its type theory, a proof assistant should only accept terminating recursive functions and productive corecursive functions. Most proof assistants enforce this through syntactic conditions, which can…
Let $T$ be a complete strongly geometric theory of fields with quantifier elimination. We show that the theory of lovely pairs of $T$ has quantifier elimination in Delon's definitional expansion by predicates for linear independence and…
In this paper, we give appropriate languages in which the theory of tame fields (of any characteristic) admits (relative) quantifier elimination.
This paper presents a sequent calculus and a dual domain semantics for a theory of definite descriptions in which these expressions are formalised in the context of complete sentences by a binary quantifier $I$. $I$ forms a formula from two…
A simple mathematical extension of quantum theory is presented. As well as opening the possibility of alternative methods of calculation, the additional formalism implies a new physical interpretation of the standard theory by providing a…
A uniform approach to computing with infinite objects like real numbers, tuples of these, compacts sets, and uniformly continuous maps is presented. In work of Berger it was shown how to extract certified algorithms working with the signed…
Quite often, verification tasks for distributed systems are accomplished via counter abstractions. Such abstractions can sometimes be justified via simulations and bisimulations. In this work, we supply logical foundations to this practice,…
This book is an introductory course to basic commutative algebra with a particular emphasis on finitely generated projective modules, which constitutes the algebraic version of the vector bundles in differential geometry. We adopt the…
We present an approach for representing abstract argumentation frameworks based on an encoding into classical higher-order logic. This provides a uniform framework for computer-assisted assessment of abstract argumentation frameworks using…
One can perform equational reasoning about computational effects with a purely functional programming language thanks to monads. Even though equational reasoning for effectful programs is desirable, it is not yet mainstream. This is partly…
Semi-unification is the combination of first-order unification and first-order matching. The undecidability of semi-unification has been proven by Kfoury, Tiuryn, and Urzyczyn in the 1990s by Turing reduction from Turing machine immortality…
As deep neural models in NLP become more complex, and as a consequence opaque, the necessity to interpret them becomes greater. A burgeoning interest has emerged in rationalizing explanations to provide short and coherent justifications for…
We present a syntactic cut-elimination procedure for the alternation-free fragment of the modal mu-calculus. Cut reduction is carried out within a cyclic proof system, where proofs are finitely branching but may be non-wellfounded. The…
Let $R$ be an o-minimal expansion of a group in a language in which $\textrm{Th}(R)$ eliminates quantifiers, and let $C$ be a predicate for a valuational cut in $R$. We identify a condition that implies quantifier elimination for…
Our research is part of a wider project that aims to investigate and reason about the correctness of scheme-based source code transformations of Erlang programs. In order to formally reason about the definition of a programming language and…
We systematically investigate the complexity of model checking the existential positive fragment of first-order logic. In particular, for a set of existential positive sentences, we consider model checking where the sentence is restricted…
Verification proofs encode complete program behavior, yet we discard them after checking correctness. We present compiling by proving, a paradigm that transforms these proofs into optimized execution rules. By constructing All-Path…
In this work, we present a logical formalism for reasoning about quantum systems in finite dimension. Contrary to the usual approach in quantum logic, our formalism is based classical first-order logic, which allows us to use the tools of…