Deduction theorems for weak implicational logics

Studia Logica 41 (2-3):95 - 108 (1982)
  Copy   BIBTEX

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.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,423

External links

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

Through your library

Analytics

Added to PP
2009-01-28

Downloads
67 (#238,510)

6 months
17 (#142,329)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Idealist Origins: 1920s and Before.Martin Davies & Stein Helgeby - 2014 - In Graham Oppy & Nick Trakakis (eds.), History of Philosophy in Australia and New Zealand. Dordrecht, Netherlands: Springer. pp. 15-54.

Add more citations

References found in this work

Entailment. Vol. 1.Alan Ross Anderson & Nuel D. Belnap - 1977 - Canadian Journal of Philosophy 7 (2):405-411.
The system LD.Haskell B. Curry - 1952 - Journal of Symbolic Logic 17 (1):35-42.
Leçons de logique algébrique.Haskell B. Curry - 1952 - Paris,: Gauthier-Villars.
Positive logic and λ-constants.David Meredith - 1978 - Studia Logica 37 (3):269 - 285.

View all 7 references / Add more references