Abstract.
The strong normalization theorem is uniformly proved for typed λ-calculi for a wide range of substructural logics with or without strong negation.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Author information
Authors and Affiliations
Corresponding author
Additional information
We would like to thank the referees for their valuable comments and suggestions. This research was supported by the Alexander von Humboldt Foundation. The second author is grateful to the Foundation for providing excellent working conditions and generous support of this research. This work was also supported by the Japanese Ministry of Education, Culture, Sports, Science and Technology, Grant-in-Aid for Young Scientists (B) 20700015, 2008.
Rights and permissions
About this article
Cite this article
Mouri, M., Kamide, N. Strong Normalizability of Typed Lambda-Calculi for Substructural Logics. Log. univers. 2, 189–207 (2008). https://doi.org/10.1007/s11787-008-0036-0
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11787-008-0036-0