Studia Logica 38 (1):75 - 85 (1979)

A logic is a pair (P,Q) where P is a set of formulas of a fixed propositional language and Q is a set of rules. A formula is deducible from X in the logic (P, Q) if it is deducible from XP via Q. A matrix is strongly adequate to (P, Q) if for any , X, is deducible from X iff for every valuation in , is designated whenever all the formulas in X are. It is proved in the present paper that if Q = {modus ponens, adjunction } and P {E, R, E +, R +, E I, R I } then there exists a matrix strongly adequate to (P, Q).
Keywords No keywords specified (fix it)
Categories (categorize this paper)
DOI 10.1007/BF00493673
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

PhilArchive copy

Upload a copy of this paper     Check publisher's policy     Papers currently archived: 56,060
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

The Pure Calculus of Entailment.Alan Ross Anderson & Nuel D. Belnap - 1962 - Journal of Symbolic Logic 27 (1):19-52.
Completeness of Relevant Quantification Theories.Robert K. Meyer, J. Michael Dunn & Hugues Leblanc - 1974 - Notre Dame Journal of Formal Logic 15 (1):97-121.

View all 9 references / Add more references

Citations of this work BETA

Fragments of R-Mingle.W. J. Blok & J. G. Raftery - 2004 - Studia Logica 78 (1-2):59-106.
On Matrices Characteristic of Relevant Logics.Wies law Dziobiak - 1981 - Bulletin of the Section of Logic 10 (3):113-114.

View all 6 citations / Add more citations

Similar books and articles


Added to PP index

Total views
37 ( #273,171 of 2,403,696 )

Recent downloads (6 months)
1 ( #550,229 of 2,403,696 )

How can I increase my downloads?


My notes