A semantical proof of the strong normalization theorem for full propositional classical natural deduction
Logic
2009-05-05 v1
Abstract
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.
Cite
@article{arxiv.0905.0358,
title = {A semantical proof of the strong normalization theorem for full propositional classical natural deduction},
author = {Karim Nour and Khelifa Saber},
journal= {arXiv preprint arXiv:0905.0358},
year = {2009}
}