Principles of Superdeduction - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2007

Principles of Superdeduction


In predicate logic, the proof that a theorem P holds in a theory Th is typically conducted in natural deduction or in the sequent calculus using all the information contained in the theory in a uniform way. Introduced ten years ago, Deduction modulo allows us to make use of the computational part of the theory Th for true computations modulo which deductions are performed. Focussing on the sequent calculus, this paper presents and studies the dual concept where the theory is used to enrich the deduction system with new deduction rules in a systematic, correct and complete way. We call such a new deduction system "superdeduction''. We introduce a proof-term language and a cut-elimination procedure both based on Christian Urban's work on classical sequent calculus. Strong normalisation is proven under appropriate and natural hypothesis, therefore ensuring the consistency of the embedded theory and of the deduction system. The proofs obtained in such a new system are much closer to the human intuition and practice. We consequently show how superdeduction along with deduction modulo can be used to ground the formal foundations of new extendible proof assistants. We finally present lemuridae, our current implementation of superdeduction modulo.
Fichier principal
Vignette du fichier
superdeduction.pdf (281 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

inria-00133557 , version 1 (26-02-2007)
inria-00133557 , version 2 (13-04-2007)
inria-00133557 , version 3 (15-05-2007)



Paul Brauner, Clement Houtmann, Claude Kirchner. Principles of Superdeduction. Twenty-Second Annual IEEE Symposium on Logic in Computer Science - LiCS 2007, Jul 2007, Wroclaw, Poland. ⟨10.1109/LICS.2007.37⟩. ⟨inria-00133557v3⟩
183 View
327 Download



Gmail Facebook X LinkedIn More