Switch to: Citations

Add references

You must login to add references.
  1. Begründung einer strengen Implikation.Wilhelm Ackermann - 1956 - Journal of Symbolic Logic 21 (2):113-128.
    Die Gründe, die C. I. Lewis [5], [6] bewogen haben, neben der gewöhnlichen Implikation eine strikte Implikation einzuführen, sind bekannt. In der vorliegenden Arbeit wird aus ähnlichen Gründen eine strenge Implikation eingeführt, die jedoch einen engeren Begriff darstellt als die strikte Implikation. Mit einer Arbeit von Arnold Schmidt [7] hat meine nur geringe Berührungspunkte, da der Verfasser sich mit der strikten Implikation beschäftigt. Für diese wird ein relativ einfaches Axiomensystem angegeben und gezeigt, wie man durch geeignete Definitionen von Notwendigkeit und (...)
    Download  
     
    Export citation  
     
    Bookmark   49 citations  
  • Begründung Einer Strengen Implikation.Wilhelm Ackermann - 1957 - Journal of Symbolic Logic 22 (3):327-328.
    Download  
     
    Export citation  
     
    Bookmark   34 citations  
  • (2 other versions)E, R and.Robert K. Meyer - 1969 - Journal of Symbolic Logic 34:460.
    Download  
     
    Export citation  
     
    Bookmark   18 citations  
  • Relevant Logics and Their Rivals.Richard Routley, Val Plumwood, Robert K. Meyer & Ross T. Brady - 1982 - Ridgeview. Edited by Richard Sylvan & Ross Brady.
    Download  
     
    Export citation  
     
    Bookmark   205 citations  
  • The semantics of entailment — III.Richard Routley & Robert K. Meyer - 1972 - Journal of Philosophical Logic 1 (2):192 - 208.
    Download  
     
    Export citation  
     
    Bookmark   90 citations  
  • (1 other version)The semantics of entailment II.Richard Routley & Robert K. Meyer - 1972 - Journal of Philosophical Logic 1 (1):53 - 73.
    Download  
     
    Export citation  
     
    Bookmark   90 citations  
  • Where gamma fails.Robert K. Meyer, Steve Giambrone & Ross T. Brady - 1984 - Studia Logica 43 (3):247 - 256.
    A major question for the relevant logics has been, “Under what conditions is Ackermann's ruleγ from -A ∨B andA to inferB, admissible for one of these logics?” For a large number of logics and theories, the question has led to an affirmative answer to theγ problem itself, so that such an answer has almost come to be expected for relevant logics worth taking seriously. We exhibit here, however, another large and interesting class of logics-roughly, the Boolean extensions of theW — (...)
    Download  
     
    Export citation  
     
    Bookmark   17 citations  
  • Completness of relevant modal logics with disjunctive rules.Takahiro Seki - 2009 - Reports on Mathematical Logic:3-18.
    Disjunctive rules are known to validate material implication principles, which may not hold in weaker relevant logics. On the other hand, they prevent the oddity of not preserving truth at the base world, from which many weaker relevant logics suffer. The same holds for relevant modal logics. This paper proves completeness of relevant modal logics with disjunctive rules.
    Download  
     
    Export citation  
     
    Bookmark   7 citations  
  • Classically complete modal relevant logics.Edwin D. Mares - 1993 - Mathematical Logic Quarterly 39 (1):165-177.
    A variety of modal logics based on the relevant logic R are presented. Models are given for each of these logics and completeness is shown. It is also shown that each of these logics admits Ackermann's rule γ and as a corollary of this it is proved that each logic is a conservative extension of its counterpart based on classical logic, hence we call them “classically complete”. MSC: 03B45, 03B46.
    Download  
     
    Export citation  
     
    Bookmark   13 citations  
  • Relevance Logic.Michael Dunn & Greg Restall - 1983 - In Dov M. Gabbay & Franz Guenthner (eds.), Handbook of Philosophical Logic. Dordrecht, Netherland: Kluwer Academic Publishers.
    Download  
     
    Export citation  
     
    Bookmark   108 citations  
  • (2 other versions)E, r, and γ.Robert K. Meyer & J. Michael Dunn - 1969 - Journal of Symbolic Logic 34 (3):460-474.
    Download  
     
    Export citation  
     
    Bookmark   26 citations  
  • (1 other version)A Sahlqvist theorem for relevant modal logics.Takahiro Seki - 2003 - Studia Logica 73 (3):383-411.
    Kripke-completeness of every classical modal logic with Sahlqvist formulas is one of the basic general results on completeness of classical modal logics. This paper shows a Sahlqvist theorem for modal logic over the relevant logic Bin terms of Routley- Meyer semantics. It is shown that usual Sahlqvist theorem for classical modal logics can be obtained as a special case of our theorem.
    Download  
     
    Export citation  
     
    Bookmark   19 citations  
  • (1 other version)A Sahlqvist Theorem for Relevant Modal Logics.Takahiro Seki - 2003 - Studia Logica 73 (3):383-411.
    Kripke-completeness of every classical modal logic with Sahlqvist formulas is one of the basic general results on completeness of classical modal logics. This paper shows a Sahlqvist theorem for modal logic over the relevant logic Bin terms of Routley-Meyer semantics. It is shown that usual Sahlqvist theorem for classical modal logics can be obtained as a special case of our theorem.
    Download  
     
    Export citation  
     
    Bookmark   18 citations  
  • (2 other versions)E, R, and $gamma$.Robert K. Meyer & J. Michael Dunn - 1969 - Journal of Symbolic Logic 34 (3):460-474.
    Download  
     
    Export citation  
     
    Bookmark   12 citations  
  • Reduced models for relevant logics without ${\rm WI}$.John K. Slaney - 1987 - Notre Dame Journal of Formal Logic 28 (3):395-407.
    Download  
     
    Export citation  
     
    Bookmark   34 citations  
  • The γ-admissibility of Relevant Modal Logics II — The Method using Metavaluations.Takahiro Seki - 2011 - Studia Logica 97 (3):351-383.
    The?-admissibility is one of the most important problems in the realm of relevant logics. To prove the 7-admissibility, either the method of normal models or the method using metavaluations may be employed. The?-admissibility of a wide class of relevant modal logics has been discussed in Part I based on a former method, but the?-admissibility based on metavaluations has not hitherto been fully considered. Sahlqvist axioms are well known as a means of expressing generalized forms of formulas with modal operators. This (...)
    Download  
     
    Export citation  
     
    Bookmark   7 citations  
  • 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.
    Download  
     
    Export citation  
     
    Bookmark   34 citations  
  • The admissibility of $\gamma$ in ${\rm R}4$.Edwin D. Mares & Robert K. Meyer - 1992 - Notre Dame Journal of Formal Logic 33 (2):197-206.
    Download  
     
    Export citation  
     
    Bookmark   7 citations  
  • Ackermann, Takeuti, and schnitt: For higher-order relevant logic.Robert K. Meyer - 1976 - Bulletin of the Section of Logic 5 (4):138-142.
    Download  
     
    Export citation  
     
    Bookmark   6 citations  
  • Some Metacomplete Relevant Modal Logics.Takahiro Seki - 2013 - Studia Logica 101 (5):1115-1141.
    A logic is called metacomplete if formulas that are true in a certain preferred interpretation of that logic are theorems in its metalogic. In the area of relevant logics, metacompleteness is used to prove primeness, consistency, the admissibility of γ and so on. This paper discusses metacompleteness and its applications to a wider class of modal logics based on contractionless relevant logics and their neighbours using Slaney’s metavaluational technique.
    Download  
     
    Export citation  
     
    Bookmark   5 citations