Proofs of Strong Normalisation for Second Order Classical Natural Deduction
Parigot, Michel
J. Symbolic Logic, Tome 62 (1997) no. 1, p. 1461-1479 / Harvested from Project Euclid
Text on Project Euclid
PDF
Alt PDF
We give two proofs of strong normalisation for second order classical natural deduction. The first one is an adaptation of the method of reducibility candidates introduced in [9] for second order intuitionistic natural deduction; the extension to the classical case requires in particular a simplification of the notion of reducibility candidate. The second one is a reduction to the intuitionistic case, using a Kolmogorov translation.
Publié le : 1997-12-14
Classification:  
@article{1183745391,
     author = {Parigot, Michel},
     title = {Proofs of Strong Normalisation for Second Order Classical Natural Deduction},
     journal = {J. Symbolic Logic},
     volume = {62},
     number = {1},
     year = {1997},
     pages = { 1461-1479},
     language = {en},
     url = {http://dml.mathdoc.fr/item/1183745391}
}

Parigot, Michel. Proofs of Strong Normalisation for Second Order Classical Natural Deduction. J. Symbolic Logic, Tome 62 (1997) no. 1, pp.  1461-1479. http://gdmltest.u-ga.fr/item/1183745391/