Proofs of strong normalisation for second order classical natural deduction

Journal of Symbolic Logic 62 (4):1461-1479 (1997)
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
Keywords No keywords specified (fix it)
Categories (categorize this paper)
Options
 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: 12,101
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.

Citations of this work BETA
René David & Karim Nour (2010). Strong Normalization Results by Translation. Annals of Pure and Applied Logic 161 (9):1171-1179.
Herman Geuvers, Robbert Krebbers & James McKinna (2013). The -Calculus. Annals of Pure and Applied Logic 164 (6):676-701.

View all 6 citations

Similar books and articles
Analytics

Monthly downloads

Added to index

2009-01-28

Total downloads

17 ( #103,270 of 1,102,119 )

Recent downloads (6 months)

11 ( #21,911 of 1,102,119 )

How can I increase my downloads?

My notes
Sign in to use this feature


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