A Semantic Proof that Reducibility Candidates entail Cut Elimination

Denis Cousineau 1, 2 Olivier Hermant 3
2 PROVAL - Proof of Programs
UP11 - Université Paris-Sud - Paris 11, Inria Saclay - Ile de France, CNRS - Centre National de la Recherche Scientifique : UMR
Abstract : Two main lines have been adopted to prove the cut elimination theorem: the syntactic one, that studies the process of reducing cuts, and the semantic one, that consists in interpreting a sequent in some algebra and extracting from this interpretation a cut-free proof of this very sequent. A link between those two methods was exhibited by studying in a semantic way, syntactical tools that allow to prove (strong) normalization of proof-terms, namely reducibility candidates. In the case of deduction modulo, a framework combining deduction and rewriting rules in which theories like Zermelo set theory and higher order logic can be expressed, this is obtained by constructing a reducibility candidates valued model. The existence of such a pre-model for a theory entails strong normalization of its proof-terms and, by the usual syntactic argument, the cut elimination property. In this paper, we strengthen this gate between syntactic and semantic methods, by providing a full semantic proof that the existence of a pre-model entails the cut elimination property for the considered theory in deduction modulo. We first define a new simplified variant of reducibility candidates à la Girard, that is sufficient to prove weak normalization of proof-terms (and therefore the cut elimination property). Then we build, from some model valued on the pre-Heyting algebra of those WN reducibility candidates, a regular model valued on a Heyting algebra on which we apply the usual soundness/strong completeness argument. Finally, we discuss further extensions of this new method towards normalization by evaluation techniques that commonly use Kripke semantics.
Type de document :
Communication dans un congrès
23rd International Conference on Rewriting Techniques and Applications (RTA'12), May 2012, Nagoya, Japan. 15, pp.133--148, 2012, <10.4230/LIPIcs.RTA.2012.133>
Liste complète des métadonnées

https://hal-mines-paristech.archives-ouvertes.fr/hal-00743284
Contributeur : Claire Medrala <>
Soumis le : jeudi 18 octobre 2012 - 15:57:07
Dernière modification le : jeudi 9 février 2017 - 15:58:16
Document(s) archivé(s) le : samedi 17 décembre 2016 - 02:00:19

Fichier

SemanticProof.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

Citation

Denis Cousineau, Olivier Hermant. A Semantic Proof that Reducibility Candidates entail Cut Elimination. 23rd International Conference on Rewriting Techniques and Applications (RTA'12), May 2012, Nagoya, Japan. 15, pp.133--148, 2012, <10.4230/LIPIcs.RTA.2012.133>. <hal-00743284>

Partager

Métriques

Consultations de
la notice

285

Téléchargements du document

446