David Bourget (Western Ontario)
David Chalmers (ANU, NYU)
Rafael De Clercq
Jack Alan Reynolds
Learn more about PhilPapers
Studia Logica 61 (2):199-221 (1998)
There is an intimate connection between proofs of the natural deduction systems and typed lambda calculus. It is well-known that in simply typed lambda calculus, the notion of formulae-as-types makes it possible to find fine structure of the implicational fragment of intuitionistic logic, i.e., relevant logic, BCK-logic and linear logic. In this paper, we investigate three classical substructural logics (GL, GLc, GLw) of Gentzen's sequent calculus consisting of implication and negation, which contain some of the right structural rules. In terms of Parigot's -calculus with proper restrictions, we introduce a proof term assignment to these classical substructural logics. According to these notions, we can classify the -terms into four categories. It is proved that well-typed GLx--terms correspond to GLx proofs, and that a GLx--term has a principal type if stratified where x is nil, c, w or cw. Moreover, we investigate embeddings of classical substructural logics into the corresponding intuitionistic substructural logics. It is proved that the Gödel-style translations of GLx--terms are embeddings preserving substructural logics. As by-products, it is obtained that an inhabitation problem is decidable and well-typed GLx--terms are strongly normalizable.
|Keywords||Philosophy Logic Mathematical Logic and Foundations Computational Linguistics|
|Categories||categorize this paper)|
Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
|Through your library|
References found in this work BETA
No references found.
Citations of this work BETA
No citations found.
Similar books and articles
Greg Restall (forthcoming). Substructural Logics. Stanford Encyclopedia of Philosophy.
Yde Venema (1995). Meeting Strength in Substructural Logics. Studia Logica 54 (1):3 - 32.
Greg Restall (1998). Displaying and Deciding Substructural Logics 1: Logics with Contraposition. Journal of Philosophical Logic 27 (2):179-216.
Motohiko Mouri & Norihiro Kamide (2008). Strong Normalizability of Typed Lambda-Calculi for Substructural Logics. Logica Universalis 2 (2):189-207.
Norihiro Kamide (2002). Kripke Semantics for Modal Substructural Logics. Journal of Logic, Language and Information 11 (4):453-470.
Greg Restall (1930). Models for Substructural Arithmetics. Australasian Journal of Philosophy 8:82-99.
Marcello D'agostino, Dov M. Gabbay & Alessandra Russo (1997). Grafting Modalities Onto Substructural Implication Systems. Studia Logica 59 (1):65-102.
Ryo Kashima & Norihiro Kamide (1999). Substructural Implicational Logics Including the Relevant Logic E. Studia Logica 63 (2):181-212.
Kosta Došen (1992). Modal Translations in Substructural Logics. Journal of Philosophical Logic 21 (3):283 - 336.
Added to index2009-01-28
Total downloads20 ( #143,407 of 1,727,972 )
Recent downloads (6 months)3 ( #211,519 of 1,727,972 )
How can I increase my downloads?