A short proof of the strong normalization of classical natural deduction with disjunction

Journal of Symbolic Logic 68 (4):1277-1288 (2003)
Abstract
We give a direct, purely arithmetical and elementary proof of the strong normalization of the cut-elimination procedure for full (i.e., in presence of all the usual connectives) classical natural deduction
Keywords No keywords specified (fix it)
Categories (categorize this paper)
DOI 10.2178/jsl/1067620187
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: 28,165
Through your library
References found in this work BETA
Normalization Without Reducibility.René David - 2000 - Annals of Pure and Applied Logic 107 (1-3):121-130.

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.
Strong Normalization Results by Translation.René David & Karim Nour - 2010 - Annals of Pure and Applied Logic 161 (9):1171-1179.
Some Properties of the-Calculus.Karim Nour & Khelifa Saber - 2012 - Journal of Applied Non-Classical Logics 22 (3):231-247.

Add more citations

Similar books and articles

Monthly downloads

Added to index

2009-01-28

Total downloads

27 ( #190,186 of 2,172,022 )

Recent downloads (6 months)

1 ( #325,967 of 2,172,022 )

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