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 | ||||||||||
| Options |
|
|||||||||
Download options| PhilPapers Archive |
Upload a copy of this paper Check publisher's policy on self-archival Papers currently archived: 5,709 |
| External links |
  Try with proxy. |
| Through your library | Configure |
Similar books and articlesLuca Viganò (2000). Labelled Non-Classical Logics. Kluwer Academic Publishers.
Ross Thomas Brady (forthcoming). Free Semantics. Journal of Philosophical Logic.
Michel Parigot (1997). Proofs of Strong Normalisation for Second Order Classical Natural Deduction. Journal of Symbolic Logic 62 (4):1461-1479.
Jan Platvono (2008). Gentzen's Proof of Normalization for Natural Deduction. Bulletin of Symbolic Logic 14 (2):240-257.
Jan Platvono (2008). Gentzen's Proof of Normalization for Natural Deduction. Bulletin of Symbolic Logic 14 (2):240-257.
David J. Pym (1995). A Note on the Proof Theory the λII-Calculus. Studia Logica 54 (2):199 - 230.
Marc Aiguier & Delphine Longuet (2010). Some General Results About Proof Normalization. Logica Universalis 4 (1).
Koji Nakazawa & Makoto Tatsuta (2003). Corrigendum to "Strong Normalization Proof with CPS-Translation for Second Order Classical Natural Deduction". Journal of Symbolic Logic 68 (4):1415-1416.
Koji Nakazawa & Makoto Tatsuta (2003). Strong Normalization Proof with CPS-Translation for Second Order Classical Natural Deduction. Journal of Symbolic Logic 68 (3):851-859.
Analytics
Monthly downloads |
Added to index2009-01-28Total downloads4 ( #178,800 of 549,592 )Recent downloads (6 months)1 ( #63,397 of 549,592 )How can I increase my downloads? |
My notes
Discussion
