Normalization in Supernatural deduction and in Deduction modulo - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Autre Publication Année : 2007

Normalization in Supernatural deduction and in Deduction modulo

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.
Fichier principal
Vignette du fichier
surded_modulo.pdf (135.67 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

inria-00141720 , version 1 (15-04-2007)
inria-00141720 , version 2 (16-11-2007)
inria-00141720 , version 3 (16-11-2007)

Identifiants

  • HAL Id : inria-00141720 , version 1

Citer

Paul Brauner, Gilles Dowek, Benjamin Wack. Normalization in Supernatural deduction and in Deduction modulo. 2007. ⟨inria-00141720v1⟩
281 Consultations
129 Téléchargements

Partager

Gmail Facebook X LinkedIn More