论文信息 - A semantical proof of the strong normalization theorem for full propositional classical natural deduction

A semantical proof of the strong normalization theorem for full propositional classical natural deduction

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.

Karim Nour | Khelifa Saber

[1] Ralph Matthes,et al. Short proofs of normalization for the simply- typed λ-calculus, permutative conversions and Gödel's T , 2003, Arch. Math. Log..

[2] Philippe de Groote,et al. Strong Normalization of Classical Natural Deduction with Disjunction , 2001, TLCA.

[3] René David,et al. A short proof of the strong normalization of classical natural deduction with disjunction , 2003, Journal of Symbolic Logic.

[4] Y. Andou,et al. Church-Rosser property of a simple reduction for full first-order classical natural deduction , 2003, Ann. Pure Appl. Log..

[5] Ralph Matthes,et al. Non-strictly positive fixed points for classical natural deduction , 2005, Ann. Pure Appl. Log..

[6] Michel Parigot,et al. Lambda-Mu-Calculus: An Algorithmic Interpretation of Classical Natural Deduction , 1992, LPAR.

[7] J. Girard,et al. Proofs and types , 1989 .

[8] Karim Nour,et al. A short proof of the strong normalization of the simply typed $\lambda\mu$-calculus , 2003, LICS 2003.

[9] Michel Parigot,et al. Proofs of strong normalisation for second order classical natural deduction , 1997, Journal of Symbolic Logic.