Deduction theorems for weak implicational logics

Studia Logica 41 (2-3):95 - 108 (1982)
The standard deduction theorem or introduction rule for implication, for classical logic is also valid for intuitionistic logic, but just as with predicate logic, other rules of inference have to be restricted if the theorem is to hold for weaker implicational logics.In this paper we look in detail at special cases of the Gentzen rule for and show that various subsets of these in effect constitute deduction theorems determining all the theorems of many well known as well as not well known implicational logics. In particular systems of rules are given which are equivalent to the relevance logics E,R, T, P-W and P-W-I.
Keywords No keywords specified (fix it)
Categories (categorize this paper)
DOI 10.1007/BF00370338
 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
PhilPapers Archive

Upload a copy of this paper     Check publisher's policy on self-archival     Papers currently archived: 24,433
External links
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
Haskell B. Curry (1952). The System LD. Journal of Symbolic Logic 17 (1):35-42.
Alan Ross Anderson & Nuel D. Belnap (1977). Entailment. Vol. 1. Canadian Journal of Philosophy 7 (2):405-411.

View all 6 references / Add more references

Citations of this work BETA

No citations found.

Add more citations

Similar books and articles

Monthly downloads

Added to index


Total downloads

36 ( #133,573 of 1,924,993 )

Recent downloads (6 months)

5 ( #187,166 of 1,924,993 )

How can I increase my downloads?

My notes
Sign in to use this feature

Start a new thread
There  are no threads in this forum
Nothing in this forum yet.