Strong normalization results by translation

Annals of Pure and Applied Logic 161 (9):1171-1179 (2010)
  Copy   BIBTEX

Abstract

We prove the strong normalization of full classical natural deduction by using a translation into the simply typed λμ-calculus. We also extend Mendler’s result on recursive equations to this system.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,881

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Natural deduction systems for some non-commutative logics.Norihiro Kamide & Motohiko Mouri - 2007 - Logic and Logical Philosophy 16 (2-3):105-146.
Atomic polymorphism.Fernando Ferreira & Gilda Ferreira - 2013 - Journal of Symbolic Logic 78 (1):260-274.
Non deterministic classical logic: the $lambdamu^{++}$-calculus.Karim Nour - 2002 - Mathematical Logic Quarterly 48 (3):357-366.
Light affine lambda calculus and polynomial time strong normalization.Kazushige Terui - 2007 - Archive for Mathematical Logic 46 (3-4):253-280.
Normalization without reducibility.René David - 2000 - Annals of Pure and Applied Logic 107 (1-3):121-130.

Analytics

Added to PP
2013-12-18

Downloads
24 (#656,974)

6 months
14 (#179,578)

Historical graph of downloads
How can I increase my downloads?