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)
 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: 9,351
External links
  • Through your library Configure
    References found in this work BETA
    Haskell B. Curry (1952). The System LD. Journal of Symbolic Logic 17 (1):35-42.
    Citations of this work BETA

    No citations found.

    Similar books and articles

    Monthly downloads

    Added to index


    Total downloads

    12 ( #106,398 of 1,088,374 )

    Recent downloads (6 months)

    1 ( #69,601 of 1,088,374 )

    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.