On Constructive Cut Admissibility in Deduction Modulo - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2006

On Constructive Cut Admissibility in Deduction Modulo

Richard Bonichon
  • Fonction : Auteur
  • PersonId : 984014
Olivier Hermant
  • Fonction : Auteur
  • PersonId : 984015

Résumé

Deduction Modulo is a theoretical framework that allows the introduction of computational steps in deductive systems. This approach is well suited to automated theorem proving. We describe a proof-search method based upon tableaux for Gentzen’s intuitionistic LJ extended with rewrite rules on propositions and terms . We prove its completeness with respect to Kripke structures. We then give a soundness proof with respect to cut-free LJ modulo. This yields a constructive proof of semantic cut elimination, which we use to characterize the relation between tableaux methods and cut elimination in the intuitionistic case.

Dates et versions

hal-01337639 , version 1 (27-06-2016)

Identifiants

Citer

Richard Bonichon, Olivier Hermant. On Constructive Cut Admissibility in Deduction Modulo. Types for Proofs and Programs, Apr 2006, Nottingham, United Kingdom. pp.33-47, ⟨10.1007/978-3-540-74464-1_3⟩. ⟨hal-01337639⟩
28 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More