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

Categories

Keywords

Reprint years

DOI

10.1007/s11787-008-0036-0

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 100,830

External links

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

Through your library

My notes

Similar books and articles

On proof terms and embeddings of classical substructural logics.Ken-Etsu Fujita - 1998 - Studia Logica 61 (2):199-221.
Term-Space Semantics of Typed Lambda Calculus.Ryo Kashima, Naosuke Matsuda & Takao Yuyama - 2020 - Notre Dame Journal of Formal Logic 61 (4):591-600.
Strong normalization of a typed lambda calculus for intuitionistic bounded linear-time temporal logic.Norihiro Kamide - 2012 - Reports on Mathematical Logic:29-61.
Normal modal substructural logics with strong negation.Norihiro Kamide - 2003 - Journal of Philosophical Logic 32 (6):589-612.
A Canonical Model Construction For Substructural Logics With Strong Negation.N. Kamide - 2002 - Reports on Mathematical Logic:95-116.
Natural deduction systems for Nelson's paraconsistent logic and its neighbors.Norihiro Kamide - 2005 - Journal of Applied Non-Classical Logics 15 (4):405-435.
Continuous normalization for the lambda-calculus and Gödel’s T.Klaus Aehlig & Felix Joachimski - 2005 - Annals of Pure and Applied Logic 133 (1-3):39-71.
The Craig interpolation theorem for prepositional logics with strong negation.Valentin Goranko - 1985 - Studia Logica 44 (3):291 - 317.
Light affine lambda calculus and polynomial time strong normalization.Kazushige Terui - 2007 - Archive for Mathematical Logic 46 (3-4):253-280.
Strong normalization of a symmetric lambda calculus for second-order classical logic.Yoriyuki Yamagata - 2002 - Archive for Mathematical Logic 41 (1):91-99.

Analytics

Added to PP
2009-01-28

Downloads
43 (#514,100)

6 months
5 (#1,025,536)

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