8 found
  1.  37
    A Metacompleteness Theorem for Contraction-Free Relevant Logics.John K. Slaney - 1984 - Studia Logica 43 (1-2):159 - 168.
    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.
    Direct download (4 more)  
    Export citation  
    Bookmark   31 citations  
  2.  16
    Reduced Models for Relevant Logics Without ${\rm WI}$.John K. Slaney - 1987 - Notre Dame Journal of Formal Logic 28 (3):395-407.
  3.  15
    A Structurally Complete Fragment of Relevant Logic.John K. Slaney & Robert K. Meyer - 1992 - Notre Dame Journal of Formal Logic 33 (4):561-566.
  4.  26
    3088 Varieties a Solution to the Ackermann Constant Problem.John K. Slaney - 1985 - Journal of Symbolic Logic 50 (2):487-501.
    It is shown that there are exactly six normal DeMorgan monoids generated by the identity element alone. The free DeMorgan monoid with no generators but the identity is characterised and shown to have exactly three thousand and eighty-eight elements. This result solves the "Ackerman constant problem" of describing the structure of sentential constants in the logic R.
    Direct download (8 more)  
    Export citation  
    Bookmark   6 citations  
  5.  20
    Linear Arithmetic Desecsed.John K. Slaney, Robert K. Meyer & Greg Restall - 1996 - Logique Et Analyse 39:379-388.
  6.  9
    On the Structure of De Morgan Monoids with Corollaries on Relevant Logic and Theories.John K. Slaney - 1988 - Notre Dame Journal of Formal Logic 30 (1):117-129.
  7.  38
    Technical Report TR-ARP-2-96.John K. Slaney, Robert K. Meyer & Greg Restall - unknown
    In classical and intuitionistic arithmetics, any formula implies a true equation, and a false equation implies anything. In weaker logics fewer implications hold. In this paper we rehearse known results about the relevant arithmetic R, and we show that in linear arithmetic LL by contrast false equations never imply true ones. As a result, linear arithmetic is desecsed. A formula A which entails 0 = 0 is a secondary equation; one entailed by 0 6= 0 is a secondary unequation. A (...)
    Direct download  
    Export citation  
  8.  60
    'Entailment' Survives Lewy's Paradoxes.John K. Slaney - 1981 - Analysis 41 (4):188 - 191.