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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
A. R. Anderson and N. D. Belnap, Entailment Vol. 1, Princeton University Press, Princeton 1975.
M. W. Bunder, Weak implicational logics based on rules for assertion, (not yet published).
A. Church, The weak positive implicational propositional calculus, Journal of Symbolic Logic, Vol. 16 (1951), p. 238.
H. B. Curry and W. Craig, Review of Church's above paper, Journal of Symbolic Logic, Vol. 17 (1952), pp. 177–178.
H. B. Curry, Generalisations of the deduction theorem, in: International Congress of Mathematicians Proceedings, Vol. 2 (1954), pp. 399–400.
S. Jaśkowski, Über Tautologien, in welchen keine Variable mehr als zweimal vorkommt, Zeitschrift für Mathematische Logik und Grundlagen der Mathematik (1963), pp. 219–228.
E. P. Martin, The P-W Problem, Doctoral dissertation, The Australian National University, 1978.
D. Meredith, Positive Logic and λ-constants, Studia, Logica, Vol. XXXVII (1978), pp. 269–285.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Bunder, M.W. Deduction theorems for weak implicational logics. Stud Logica 41, 95–108 (1982). https://doi.org/10.1007/BF00370338
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF00370338