A metacompleteness theorem for contraction-free relevant logics

Studia Logica 43 (1-2):159 - 168 (1984)
I note that the logics of the relevant group most closely tied to the research programme in paraconsistency are those without the contraction postulate(A.AB).AB and its close relatives. As a move towards gaining control of the contraction-free systems I show that they are prime (that wheneverA B is a theorem so is eitherA orB). The proof is an extension of the metavaluational techniques standardly used for analogous results about intuitionist logic or the relevant positive logics.
Keywords No keywords specified (fix it)
Categories (categorize this paper)
DOI 10.1007/BF00935747
 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: 23,209
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
Robert K. Meyer (1976). Metacompleteness. Notre Dame Journal of Formal Logic 17 (4):501-516.
Robert K. Meyer (1976). Negation Disarmed. Notre Dame Journal of Formal Logic 17 (2):184-190.

Add more references

Citations of this work BETA
Kosta Došen (1992). Modal Translations in Substructural Logics. Journal of Philosophical Logic 21 (3):283 - 336.

View all 16 citations / Add more citations

Similar books and articles

Monthly downloads

Added to index


Total downloads

14 ( #314,307 of 1,940,985 )

Recent downloads (6 months)

5 ( #197,910 of 1,940,985 )

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.