inria-00141720, version 3
Normalization in Supernatural deduction and in Deduction modulo
Paul Brauner
a, 1Gilles Dowek 2Benjamin Wack b, 1
(2007)
Résumé : Deduction modulo and Supernatural deduction are two extentions of predicate logic with computation rules. Whereas the application of computation rules in deduction modulo is transparent, these rules are used to build non-logical deduction rules in Supernatural deduction. In both cases, adding computation rules may jeopardize proof normalization, but various conditions have been given in both cases, so that normalization is preserved. We prove in this paper that normalization in Supernatural deduction and in Deduction modulo are equivalent, i.e. the set of computation rules for which one system strongly normalizes is the same as the set of computation rules for which the other is.
- a – Institut National Polytechnique de Lorraine
- b – ENS LYON
- 1 : PROTHEO (INRIA Lorraine - LORIA)
- INRIA – CNRS : UMR7503 – Université Henri Poincaré - Nancy I – Université Nancy II – Institut National Polytechnique de Lorraine (INPL)
- 2 : LOGICAL (INRIA Futurs)
- INRIA – CNRS : UMR8623 – CNRS : FRE 2653 – Université Paris XI - Paris Sud – Polytechnique - X
- Domaine : Informatique/Logique en informatique
- Mots-clés : deduction modulo – normalization – superdeduction
- Versions disponibles : v1 (16-04-2007) v2 (16-11-2007) v3 (16-11-2007)
- inria-00141720, version 3
- http://hal.inria.fr/inria-00141720
- oai:hal.inria.fr:inria-00141720
- Contributeur : Paul Brauner
- Soumis le : Vendredi 16 Novembre 2007, 11:16:01
- Dernière modification le : Vendredi 16 Novembre 2007, 11:17:43






Documents associés
Exporter