Zenon Modulo: When Achilles Outruns the Tortoise using Deduction Modulo

In this paper, we exhibit a new algebra C 0 which is a refinement of C and we prove that having a C 0 -valued model is still a sufficient semantic condition of strongly

This encoding allows us, first, to properly define matching modulo β using the notion of higher order rewriting and, secondly, to make available, in the λ Π-calculus Modulo,

Our goal in this talk is twofold: first, we want to go further and show that other systems can be expressed in the λΠ-calculus modulo theory, in particular classical systems,

The paper is organized as follows: in Section 2, we introduce the principles of Deduction modulo theory; in Sections 3 and 4, we present the two ATPs Zenon Modulo and

We also present the associated automated theorem prover Zenon Modulo , an extension of Zenon to polymorphic types and deduction modulo, along with its backend to the Dedukti

SN (hene that, for primitive prediate symbols, omputability is equivalent to strong normalization), sine this property is used for proving that a terminating. and non-dupliating

Using orthogonality, we have constructed a pre-Boolean algebra of sequents which allows to prove that our classical superconsistency criterion implies cut-elimination in

A way to prove the soundness and completeness of Equational resolution is to introduce a Natural deduction system, or a Sequent calculus system, where propositions are identified