scientific article; zbMATH DE number 596497

J. Michael Dunn, A. R. Anderson, Nuel D. jun. Belnap

Publication date: 28 June 1994

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Philosophical and critical aspects of logic and foundations (03A05) Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations (03-02) Substructural logics (including relevance, entailment, linear logic, Lambek calculus, BCK and BCI logics) (03B47)

Related Items

IN MEMORIAM: J. MICHAEL DUNN, 1941–2021 ⋮ Representable idempotent commutative residuated lattices ⋮ The Logic of Bunched Implications ⋮ On When a Disjunction Is Informative ⋮ Devising the set of abnormalities for a given defeasible rule ⋮ EF4, EF4-M and EF4-Ł: A companion to BN4 and two modal four-valued systems without strong Łukasiewicz-type modal paradoxes ⋮ The Relevance of Relevance to Relevance Logic ⋮ 1994 Annual Meeting of the Association for Symbolic Logic ⋮ A computational interpretation of conceptivism ⋮ Substructural epistemic logics ⋮ Judgement aggregation in non-classical logics ⋮ SEMANTICS FOR PURE THEORIES OF CONNEXIVE IMPLICATION ⋮ PROBABILISTIC ENTAILMENT ON FIRST ORDER LANGUAGES AND REASONING WITH INCONSISTENCIES ⋮ Two, Many, and Differently Many ⋮ Measuring evidence: a probabilistic approach to an extension of Belnap-Dunn logic ⋮ RELEVANCE FOR THE CLASSICAL LOGICIAN ⋮ Varieties of Relevant S5 ⋮ On elimination of quantifiers in some non‐classical mathematical theories ⋮ Modal information logics: axiomatizations and decidability ⋮ Non-Boolean classical relevant logics. II: Classicality through truth-constants ⋮ TRANSLATIONS BETWEEN LINEAR AND TREE NATURAL DEDUCTION SYSTEMS FOR RELEVANT LOGICS ⋮ A substructural approach to explicit modal logic ⋮ Ternary Relational Semantics for the Variants of BN4 and E4 which Contain Routley and Meyer's Logic B ⋮ INFINITARY PROPOSITIONAL RELEVANT LANGUAGES WITH ABSURDITY ⋮ AUTOMATED CORRESPONDENCE ANALYSIS FOR THE BINARY EXTENSIONS OF THE LOGIC OF PARADOX ⋮ Free of Detachment: Logic, Rationality, and Gluts ⋮ ASSERTIONALLY EQUIVALENT QUASIVARIETIES ⋮ Relational semantics for the 4-valued relevant logics BN4 and E4 ⋮ Knowledge representation as domain ⋮ A framework for knowledge-based systems ⋮ Manipulating Sources of Information: Towards an Interpretation of Linear Logic and Strong Relevance Logic ⋮ Truth, Falsehood, Information and Beyond: The American Plan Generalized ⋮ Two, Three, Four, Infinity: The Path to the Four-Valued Logic and Beyond ⋮ K3, Ł3, LP, RM3, A3, FDE, M: How to Make Many-Valued Logics Work for You ⋮ From Iff to Is: Some New Thoughts on Identity in Relevant Logics ⋮ Two pretabular linear extensions of relevance logic R ⋮ Making Sense of Paraconsistent Logic: The Nature of Logic, Classical Logic and Paraconsistent Logic ⋮ Unnamed Item ⋮ LP⁺, K3⁺, FDE⁺, AND THEIR ‘CLASSICAL COLLAPSE’ ⋮ A SIMPLE APPROACH TOWARDS RECAPTURING CONSISTENT THEORIES IN PARACONSISTENT SETTINGS ⋮ Comments on some completeness theorems of Urquhart and Méndez \& Salto ⋮ A dynamic characterization of the pure logic of relevant implication ⋮ A natural deduction system for first degree entailment ⋮ Skepticism and floating conclusions ⋮ THE RELEVANT FRAGMENT OF FIRST ORDER LOGIC ⋮ Semantics for a basic relevant logic with intensional conjunction and disjunction (and some of its extensions) ⋮ An Explanation for the Ternary Relation R in the Relational Semantics of Relevance Logic ⋮ Why Paraconsistent Logics? ⋮ A Survey of Annotated Logics ⋮ Larisa Maksimova’s Early Contributions to Relevance Logic ⋮ Modal translation of substructural logics ⋮ Unnamed Item ⋮ CUT AND GAMMA I: PROPOSITIONAL AND CONSTANT DOMAIN R ⋮ An alternative semantics for quantified relevant logic ⋮ MULTIPLE-CONCLUSION LP AND DEFAULT CLASSICALITY ⋮ CONSERVATIVITY OF HEYTING IMPLICATION OVER RELEVANT QUANTIFICATION ⋮ Relevance logics and intuitionistic negation ⋮ The Relevance of Semantic Subtyping ⋮ On recent applications of paraconsistent logic: an exploratory literature review ⋮ Relevance Logic as a Conservative Extension of Classical Logic ⋮ Implicational Logic, Relevance, and Refutability ⋮ Introduction: Non-classical Logics—Between Semantics and Proof Theory (In Relation to Arnon Avron’s Work) ⋮ R-Mingle is Nice, and so is Arnon Avron ⋮ Relevance-Sensitive Truth-Trees ⋮ Tarskian Classical Relevant Logic ⋮ Beth Definability in the Logic KR ⋮ St. Alasdair on Lattices Everywhere ⋮ Comments on the Contributions ⋮ Current trends in substructural logics ⋮ The eco-cognitive model of abduction. II. Irrelevance and implausibility exculpated ⋮ ``Four-valued semantics for the relevant logic R ⋮ A relevant logic of questions ⋮ A stone-type duality theorem for separation logic via its underlying bunched logics ⋮ Syntactical investigations into \(BI\) logic and \(BB^ \prime I\) logic ⋮ General information in relevant logic ⋮ Linear and affine logics with temporal, spatial and epistemic operators ⋮ Algebraic study of two deductive systems of relevance logic ⋮ Neighbourhood semantics for quantified relevant logics ⋮ An admissible semantics for propositionally quantified relevant logics ⋮ Relevant predication. I: The formal theory ⋮ Deontic logic as founded on nonmonotonic logic ⋮ Positive modal logic ⋮ Combinatory logic and the semantics of substructural logics ⋮ Between Hilbert and Gentzen: four-valued consequence systems and structural reasoning ⋮ What is a relevant connective? ⋮ Ternary relations and relevant semantics ⋮ Correspondence analysis and automated proof-searching for first degree entailment ⋮ \(\mathbf R\) and relevance principle revisited ⋮ The strong version of a sentential logic ⋮ What is relevance logic? ⋮ Symmetric generalized Galois logics ⋮ The concept of relevance and the logic diagram tradition ⋮ First-degree entailment and its relatives ⋮ Blending under deconstruction. The roles of logic, ontology, and cognition in computational concept invention ⋮ A category equivalence for odd Sugihara monoids and its applications ⋮ Editorial introduction: substructural logics and metainferences ⋮ HYPE: a system of hyperintensional logic (with an application to semantic paradoxes) ⋮ Constrained consequence ⋮ Neighbourhood semantics for modal relevant logics ⋮ Farewell to suppression-freedom ⋮ Nothing but the truth ⋮ Order-dual relational semantics for non-distributive propositional logics: a general framework ⋮ Neighborhoods for entailment ⋮ A plea for KR ⋮ A variant with the variable-sharing property of Brady's 4-valued implicative expansion BN4 of Anderson and Belnap's logic FDE ⋮ A second pretabular classical relevance logic ⋮ Relation algebras of Sugihara, Belnap, Meyer, and Church ⋮ Contradictory information: too much of a good thing ⋮ Representation of interlaced trilattices ⋮ The semantics of entailment omega ⋮ Paraconsistency everywhere ⋮ Making ``stricterness more relevant ⋮ \(LE^{t}_{ \to }, LR^{ \circ }_{\widehat{\sim}}, LK\) and cutfree proofs ⋮ Varieties of De Morgan monoids: minimality and irreducible algebras ⋮ Algebraic Kripke-style semantics for relevance logics ⋮ Recovering quantum logic within an extended classical framework ⋮ Informational semantics as a third alternative? ⋮ An incomplete relevant modal logic ⋮ Logical pluralism and semantic information ⋮ A generalization of the Routley-Meyer semantic framework ⋮ A new approach to classical relevance ⋮ Modal and intuitionistic variants of extended Belnap-Dunn logic with classical negation ⋮ Basic quasi-Boolean expansions of relevance logics ⋮ Combining explicit negation and negation by failure via Belnap's logic ⋮ Belnap's logic and conditional composition ⋮ A characteristic frame for positive intuitionistic and relevance logic ⋮ Semantics for relevance logic with identity ⋮ Aristotle's assertoric syllogistic and modern relevance logic ⋮ The equational theories of representable residuated semigroups ⋮ New consecution calculi for \(R^{t}_{\to}\) ⋮ Extracting \(\mathsf{BB'IW}\) inhabitants of simple types from proofs in the sequent calculus \(LT_\to^t\) for implicational ticket entailment ⋮ The scope of Gödel's first incompleteness theorem ⋮ A Routley-Meyer type semantics for relevant logics including \(\text B_{\text r}\) plus the disjunctive syllogism ⋮ Normal proofs, cut free derivations and structural rules ⋮ A calculus for four-valued sequential logic ⋮ Fragments of R-mingle ⋮ Bi-facial truth: a case for generalized truth values ⋮ Aristotle's Thesis between paraconsistency and modalization ⋮ Combining classical logic, paraconsistency and relevance ⋮ The \textsc{Fmla-Fmla} axiomatizations of the exactly true and non-falsity logics and some of their cousins ⋮ Existentially closed de Morgan algebras ⋮ Characterizing finite-valuedness ⋮ Hyper-contradictions, generalized truth values and logics of truth and falsehood ⋮ A cut-elimination proof in positive relevant logic with necessity ⋮ A systematic methodology for automated theorem finding ⋮ Simple hyperintensional belief revision ⋮ Displaying and deciding substructural logics. I: Logics with contraposition ⋮ Identity in Mares-Goldblatt models for quantified relevant logic ⋮ Identity and aboutness ⋮ Simple axiomatizations for pretabular classical relevance logics ⋮ The logical structure of linguistic commitment. II: Systems of relevant commitment entailment ⋮ Cut-free sequent calculus and natural deduction for the tetravalent modal logic ⋮ Impossible worlds: A modest approach ⋮ Inconsistency without contradiction ⋮ Proof theory of Nelson's paraconsistent logic: a uniform perspective ⋮ Semantics for dual and symmetric combinatory calculi ⋮ An incompleteness theorem for modal relevant logics ⋮ A few more useful 8-valued logics for reasoning with tetralattice \(EIGHT_{4}\) ⋮ Relevant identity ⋮ CE is not a conservative extension of E ⋮ A note on FDE ``all the way up ⋮ Relevant logic and the theory of information ⋮ The theory of the process of explanation generalized to include the inconsistent case ⋮ The logic of generalized truth values and the logic of bilattices ⋮ Lower semilattice-ordered residuated semigroups and substructural logics ⋮ Types of I-free hereditary right maximal terms ⋮ Why ramify? ⋮ Some useful 16-valued logics: How a computer network should think