Strong Normalizability of Typed Lambda-Calculi for Substructural Logics

Logica Universalis 2 (2):189-207 (2008)
  Copy   BIBTEX

Abstract

The strong normalization theorem is uniformly proved for typed λ-calculi for a wide range of substructural logics with or without strong negation

Links

PhilArchive



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

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

Normal modal substructural logics with strong negation.Norihiro Kamide - 2003 - Journal of Philosophical Logic 32 (6):589-612.
Kripke semantics for modal substructural logics.Norihiro Kamide - 2002 - Journal of Logic, Language and Information 11 (4):453-470.
Substructural Logics.Greg Restall - forthcoming - Stanford Encyclopedia of Philosophy.
Modal translations in substructural logics.Kosta Došen - 1992 - Journal of Philosophical Logic 21 (3):283 - 336.
Meeting strength in substructural logics.Yde Venema - 1995 - Studia Logica 54 (1):3 - 32.

Analytics

Added to PP
2009-01-28

Downloads
36 (#432,773)

6 months
3 (#992,474)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

Constructible falsity and inexact predicates.Ahmad Almukdad & David Nelson - 1984 - Journal of Symbolic Logic 49 (1):231-233.
Natural deduction systems for Nelson's paraconsistent logic and its neighbors.Norihiro Kamide - 2005 - Journal of Applied Non-Classical Logics 15 (4):405-435.
Natural deduction systems for some non-commutative logics.Norihiro Kamide & Motohiko Mouri - 2007 - Logic and Logical Philosophy 16 (2-3):105-146.

Add more references