Switch to: Citations

Add references

You must login to add references.
  1. An axiomatic version of positive semilattice relevance logic.G. Charlwood - 1981 - Journal of Symbolic Logic 46 (2):233-239.
    Download  
     
    Export citation  
     
    Bookmark   12 citations  
  • Gupta's rule of revision theory of truth.Nuel D. Belnap - 1982 - Journal of Philosophical Logic 11 (1):103-116.
    Gupta’s Rule of Revision theory of truth builds on insights to be found in Martin and Woodruff and Kripke in order to permanently deepen our understanding of truth, of paradox, and of how we work our language while our language is working us. His concept of a predicate deriving its meaning by way of a Rule of Revision ought to impact significantly on the philosophy of language. Still, fortunately, he has left me something to.
    Download  
     
    Export citation  
     
    Bookmark   52 citations  
  • Display logic.Nuel D. Belnap - 1982 - Journal of Philosophical Logic 11 (4):375-417.
    Download  
     
    Export citation  
     
    Bookmark   110 citations  
  • A consecutive calculus for positive relevant implication with necessity.Nuel D. Belnap, Anil Gupta & J. Michael Dunn - 1980 - Journal of Philosophical Logic 9 (4):343-362.
    Download  
     
    Export citation  
     
    Bookmark   6 citations  
  • Semantics for relevant logics.Alasdair Urquhart - 1972 - Journal of Symbolic Logic 37 (1):159-169.
    Download  
     
    Export citation  
     
    Bookmark   95 citations  
  • Multisets and relevant implication I.Robert K. Meyer & Michael A. McRobbie - 1982 - Australasian Journal of Philosophy 60 (2):107 – 139.
    Download  
     
    Export citation  
     
    Bookmark   20 citations  
  • Multisets and Relevant Implication.R. K. Meyer - 1982 - Australasian Journal of Philosophy 60:107.
    Download  
     
    Export citation  
     
    Bookmark   20 citations  
  • Gentzen formulations of two positive relevance logics.Aleksandar Kron - 1980 - Studia Logica 39 (4):381 - 403.
    The author gentzenizes the positive fragmentsT + andR + of relevantT andR using formulas with, prefixes (subscripts). There are three main Gentzen formulations ofS +{T+,R +} calledW 1 S +,W 2 S + andG 2 S +. The first two have the rule of modus ponens. All of them have a weak rule DL for disjunction introduction on the left. DL is not admissible inS + but it is needed in the proof of a cut elimination theorem forG 2 S (...)
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • Gentzen formulations of two positive relevance logics.Aleksandar Kron - 1981 - Studia Logica 40 (3):381 - 403.
    The author gentzenizes the positive fragments T₊ and R₊ of relevant T and R using formulas with prefixes (subscripts). There are three main Gentzen formulations of $S_{+}\in \{T_{+},R_{+}\}$ called W₁ S₊, W₂ S₊ and G₂ S₊. The first two have the rule of modus ponens. All of them have a weak rule DL for disjunction introduction on the left. DL is not admissible in S₊ but it is needed in the proof of a cut elimination theorem for G₂ S₊. W₁ (...)
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • TW+ and RW+ are decidable.Steve Giambrone - 1985 - Journal of Philosophical Logic 14 (3):235 - 254.
    Download  
     
    Export citation  
     
    Bookmark   23 citations  
  • Proof Theories for Semilattice Logics.Steve Giambrone & Alasdaire Urquhart - 1987 - Mathematical Logic Quarterly 33 (5):433-439.
    Download  
     
    Export citation  
     
    Bookmark   11 citations  
  • The collected papers of Gerhard Gentzen.Gerhard Gentzen - 1969 - Amsterdam,: North-Holland Pub. Co.. Edited by M. E. Szabo.
    Download  
     
    Export citation  
     
    Bookmark   114 citations