Deduction theorems for weak implicational logics

Studia Logica 41 (2-3):95 - 108 (1982)
Abstract
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
Options
 Save to my reading list
Follow the author(s)
Edit this record
My bibliography
Export citation
Find it on Scholar
Mark as duplicate
Request removal from index
Revision history
Download options
Our Archive


Upload a copy of this paper     Check publisher's policy     Papers currently archived: 30,349
Through your library
References found in this work BETA
The System LD.Haskell B. Curry - 1952 - Journal of Symbolic Logic 17 (1):35-42.
Entailment. Vol. 1.Alan Ross Anderson & Nuel D. Belnap - 1977 - Canadian Journal of Philosophy 7 (2):405-411.
Positive Logic and Λ-Constants.David Meredith - 1978 - Studia Logica 37 (3):269 - 285.

View all 6 references / Add more references

Citations of this work BETA

No citations found.

Add more citations

Similar books and articles
Added to PP index
2009-01-28

Total downloads
37 ( #143,275 of 2,193,594 )

Recent downloads (6 months)
1 ( #290,647 of 2,193,594 )

How can I increase my downloads?

Monthly downloads
My notes
Sign in to use this feature