Proofs of strong normalisation for second order classical natural deduction

Journal of Symbolic Logic 62 (4):1461-1479 (1997)
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
Keywords No keywords specified (fix it)
Categories (categorize this paper)
DOI 10.2307/2275652
 Save to my reading list
Follow the author(s)
My bibliography
Export citation
Find it on Scholar
Edit this record
Mark as duplicate
Revision history Request removal from index
Download options
PhilPapers Archive

Upload a copy of this paper     Check publisher's policy on self-archival     Papers currently archived: 16,658
External links
Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library
References found in this work BETA

No references found.

Add more references

Citations of this work BETA
Herman Geuvers, Robbert Krebbers & James McKinna (2013). The -Calculus. Annals of Pure and Applied Logic 164 (6):676-701.

View all 7 citations / Add more citations

Similar books and articles

Monthly downloads

Added to index


Total downloads

27 ( #114,246 of 1,725,989 )

Recent downloads (6 months)

6 ( #118,705 of 1,725,989 )

How can I increase my downloads?

My notes
Sign in to use this feature

Start a new thread
There  are no threads in this forum
Nothing in this forum yet.