Classical relevant logics. I

DOI10.1007/BF02123812zbMath0316.02029OpenAlexW4239428245MaRDI QIDQ1221097

Robert K. Meyer, Richard Routley

Publication date: 1973

Published in: Studia Logica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02123812

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) General logic (03B99)

Related Items (25)

Current trends in substructural logics ⋮ Convolution as a Unifying Concept ⋮ Relevant restricted quantification ⋮ What is a relevant connective? ⋮ RELEVANCE LOGICS AND RELATION ALGEBRAS ⋮ Gentzen-type sequent calculi for extended Belnap-Dunn logics with classical negation: a general framework ⋮ New axiomatics for relevant logics. I ⋮ Neighbourhood semantics for modal relevant logics ⋮ Completeness and conservative extension results for some Boolean relevant logics ⋮ R\(\urcorner\)-algebras and R\(\urcorner\)-model structures as power constructs ⋮ Relation algebras of Sugihara, Belnap, Meyer, and Church ⋮ Gentzenizations of relevant logics with distribution ⋮ RELEVANCE LOGIC AND THE CALCULUS OF RELATIONS ⋮ Classical negation and expansions of Belnap-Dunn logic ⋮ Two Negations Are More than One ⋮ Modal and intuitionistic variants of extended Belnap-Dunn logic with classical negation ⋮ Basic quasi-Boolean expansions of relevance logics ⋮ Classical relevant logics. II ⋮ Extensions of Priest-da Costa logic ⋮ Relevance logics and intuitionistic negation ⋮ A basic quasi-Boolean logic of intuitionistic character ⋮ CE is not a conservative extension of E ⋮ On S ⋮ Tarskian Classical Relevant Logic ⋮ 3088 varieties: A solution to the Ackermann constant problem

Cites Work

• Conservative extension in relevant implication
• Modalities in Ackermann's “rigorous implication”
• A completeness theorem in modal logic
• The pure calculus of entailment
• A Decision Procedure For the System E_Ī of Entailment with Negation
• Intensional models for first degree formulas

This page was built for publication: Classical relevant logics. I