Related papers: Contraction Elimination in Sequent Based Ground Eq…
Working in a semi-constructive logical system that supports the extraction of concurrent programs, we extract a program inverting non-singular real valued matrices from a constructive proof based on Gaussian elimination. Concurrency is used…
This paper represents classical propositional proofs as *combinatorial proofs*, which are more abstract than proof nets: superposition (contraction/weakening) is modelled mathematically, as a lax form of fibration, rather than syntactically…
Proof schemata are a variant of LK-proofs able to simulate various induction schemes in first-order logic by adding so called proof links to the standard first-order LK-calculus. Proof links allow proofs to reference proofs thus giving…
We show that if a theory R defined by a rewrite system is super-consistent, the classical sequent calculus modulo R enjoys the cut elimination property, which was an open question. For such theories it was already known that proofs strongly…
The celebrated Trakhtenbrot's theorem states that the set of finitely valid sentences of first-order logic is not computably enumerable. In this note we will extend this theorem by proving that the finite satisfiability problem of any…
In this paper, we show that contraction operations preserve the homology of $n$D generalized maps, under some conditions. Removal and contraction operations are used to propose an efficient algorithm that compute homology generators of $n$D…
We consider the use of Quantifier Elimination (QE) technology for automated reasoning in economics. QE dates back to Tarski's work in the 1940s with software to perform it dating to the 1970s. There is a great body of work considering its…
In this Part I, we shall prove the consistency of arithmetic without complete induction from a point of view of strong negation, using its embedding to the tableau system $\bf SN$ of constructive arithmetic with strong negation without…
We show that the truncated simplex Hilbert transform enjoys some cancellation in the sense that its norm grows sublinearly in the number of scales retained in the truncation. This extends the recent result by Tao on cancellation for the…
Full first order linear logic can be presented as an abstract logic programming language in Miller's system Forum, which yields a sensible operational interpretation in the 'proof search as computation' paradigm. However, Forum still has to…
Bi-intuitionistic logic is the extension of intuitionistic logic with a connective dual to implication. Bi-intuitionistic logic was introduced by Rauszer as a Hilbert calculus with algebraic and Kripke semantics. But her subsequent…
In this paper, we study a CPT-even Lorentz-breaking extension of the scalar QED. For this theory, we calculate the one-loop lower-order contributions in the Lorentz-violating parameters to the two-point functions of scalar and gauge fields.…
A logical system derived from linear logic and called QMLL is introduced and shown able to capture all unitary quantum circuits. Conversely, any proof is shown to compute, through a concrete GoI interpretation, some quantum circuits. The…
We describe a new method to compute general cubature formulae. The problem is initially transformed into the computation of truncated Hankel operators with flat extensions. We then analyse the algebraic properties associated to flat…
Let $K$ be an algebraically closed field of characteristic different from $2$. We provide a positive solution to the Bahturin--Regev conjecture in the general finite-dimensional (non-graded) setting, assuming that $\operatorname{char}(K)$…
We present a sequent calculus for first-order logic with lambda terms and definite descriptions. The theory formalised by this calculus is essentially Russellian, but avoids some of its well known drawbacks and treats definite description…
We show that the central finite difference formula for the first and the second derivative of a function can be derived, in the context of quantum mechanics, as matrix elements of the momentum and kinetic energy operators using, as a basis…
We consider the possible consistent truncation of N-extended supergravities to lower N' theories. The truncation, unlike the case of N-extended rigid theories, is non trivial and only in some cases it is sufficient just to delete the extra…
We study a class of bilevel integer programs with second-order cone constraints at the upper level and a convex quadratic objective and linear constraints at the lower level. We develop disjunctive cuts to separate bilevel infeasible points…
Double twist knots $K_{m, n}$ are known to be rationally slice if $mn = 0$, $n = -m\pm 1$, or $n = -m$. In this paper, we prove the converse. It is done by showing that infinitely many prime power-fold cyclic branched covers of the other…