A semantical proof of the strong normalization theorem for full propositional classical natural deduction
Résumé
We give in this paper a short semantical proof of the strong normalization for full propositional classical natural deduction. This proof is an adaptation of reducibility candidates introduced by J.-Y. Girard and simplified to the classical case by M. Parigot.
Domaines
Logique [math.LO]
Origine : Fichiers produits par l'(les) auteur(s)
Loading...