Search

The paraconsistent and paracomplete 4-valued logic PŁ4 is originally interpreted with a two-valued Belnap-Dunn semantics. In the present paper, PŁ4 is endowed with both a ternary Routley-Meyer semantics and a binary Routley semantics together with their respective restriction to the 2 set-up case. [ABSTRACT FROM AUTHOR]

The logic BN4 was defined by R.T. Brady in 1982. It can be considered as the 4-valued logic of the relevant conditional. E4 is a variant of BN4 that can be considered as the 4-valued logic of (relevant) entailment. The aim of this paper is to define reduced general Routley-Meyer semantics for BN4 and E4. It is proved that BN4 and E4 are strongly sound and complete w.r.t. their respective semantics. [ABSTRACT FROM AUTHOR]

A simple Henkin-style completeness proof for Gödel 3-valued propositional logic G3 is provided. The idea is to endow G3 with an underdetermined semantics (u-semantics) of the type defined by Dunn. The key concept in u-semantics is that of "under-determined interpretation" (u-interpretation). It is shown that consistent prime theories built upon G3 can be understood as (canonical) u-interpretations. In order to prove this fact we follow Brady by defining G3 as an extension of Anderson and Belnap's positive fragment of First Degree Entailment Logic. [ABSTRACT FROM AUTHOR]

A simple Henkin-style completeness proof for Gödel 3-valued propositional logic G3 is provided. The idea is to endow G3 with an under-determined semantics (u-semantics) of the type defined by Dunn. The key concept in u-semantics is that of "under-determined interpretation" (u-interpretation). It is shown that consistent prime theories built upon G3 can be understood as (canonical) u-interpretations. In order to prove this fact we follow Brady by defining G3 as an extension of Anderson and Belnap's positive fragment of First Degree Entailment Logic. [ABSTRACT FROM AUTHOR]

It is proved that Ackermann's rule δ is admissible in a wide spectrum of relevant logics satisfying certain syntactical properties. [ABSTRACT FROM AUTHOR]

In our paper "A general characterization of the variable-sharing property by means of logical matrices", a general class of so-called "Relevant logical matrices", RMLs, is defined. The aim of this paper is to define a class of simpler Relevant logical matrices RMLs' serving the same purpose that RMLs, to wit: any logic verified by an RML' has the variable-sharing property and related properties predicable of the logic of entailment E and of the logic of relevance R. [ABSTRACT FROM AUTHOR]

A restriction of R-Mingle with the variable-sharing property and the Ackermann properties is defined. From an intuitive semantical point of view, this restriction is an alternative to Anderson and Belnap's logic of entailment E. [ABSTRACT FROM AUTHOR]