Strong Normalizability of Typed Lambda-Calculi for Substructural Logics

Logica Universalis 2 (2):189-207 (2008)
Abstract
The strong normalization theorem is uniformly proved for typed λ-calculi for a wide range of substructural logics with or without strong negation
Keywords Substructural logic  strong normalization  typed lambda calculus
Categories (categorize this paper)
DOI 10.1007/s11787-008-0036-0
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,767
Through your library
References found in this work BETA

No references found.

Add more references

Citations of this work BETA

No citations found.

Add more citations

Similar books and articles
Meeting Strength in Substructural Logics.Yde Venema - 1995 - Studia Logica 54 (1):3 - 32.
Modal Translations in Substructural Logics.Kosta Došen - 1992 - Journal of Philosophical Logic 21 (3):283 - 336.
Substructural Logics.Greg Restall - forthcoming - Stanford Encyclopedia of Philosophy.
Kripke Semantics for Modal Substructural Logics.Norihiro Kamide - 2002 - Journal of Logic, Language and Information 11 (4):453-470.
Normal Modal Substructural Logics with Strong Negation.Norihiro Kamide - 2003 - Journal of Philosophical Logic 32 (6):589-612.

Monthly downloads

Added to index

2009-01-28

Total downloads

18 ( #261,148 of 2,146,969 )

Recent downloads (6 months)

1 ( #385,507 of 2,146,969 )

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