Hostname: page-component-7b7567c8c-tnkh4 Total loading time: 0 Render date: 2026-11-16T20:01:49.947Z Has data issue: false hasContentIssue false

Proofs of strong normalisation for second order classical natural deduction

Published online by Cambridge University Press:  12 March 2014

Michel Parigot*
Affiliation:
Equipe de Logique—CNRS UA 753, 45-55 5Ème Étage, Université Paris7, 2 Place Jussieu, 75251 Paris Cedex 05, France E-mail: parigot@logique.jussieu.fr

Abstract

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.

Information

Type
Research Article
Copyright
Copyright © Association for Symbolic Logic 1997

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable