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)
DOI 10.2307/2275652
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
Our Archive


Upload a copy of this paper     Check publisher's policy     Papers currently archived: 25,651
Through your library
References found in this work BETA

No references found.

Add more references

Citations of this work BETA
Non-Strictly Positive Fixed Points for Classical Natural Deduction.Ralph Matthes - 2005 - Annals of Pure and Applied Logic 133 (1):205-230.
Call-by-Name Reduction and Cut-Elimination in Classical Logic.Kentaro Kikuchi - 2008 - Annals of Pure and Applied Logic 153 (1):38-65.
The -Calculus.Herman Geuvers, Robbert Krebbers & James McKinna - 2013 - Annals of Pure and Applied Logic 164 (6):676-701.

View all 8 citations / Add more citations

Similar books and articles

Monthly downloads

Added to index

2009-01-28

Total downloads

32 ( #153,601 of 2,143,562 )

Recent downloads (6 months)

2 ( #280,273 of 2,143,562 )

How can I increase my downloads?

My notes
Sign in to use this feature


Discussion
Order:
There  are no threads in this forum
Nothing in this forum yet.

Other forums