Belnap and Dunn’s well-known 4-valued logic FDE is an interesting and useful non-classical logic. FDE is defined by using conjunction, disjunction and negation as the sole propositional connectives. Then the question of expanding FDE with an implication connective is of course of great interest. In this sense, some implicative expansions of FDE have been proposed in the literature, among which Brady’s logic BN4 seems to be the preferred option of relevant logicians. The aim of this paper is to define a (...) class of implicative expansions of FDE in whose elements Boolean negation is definable, whence strong logics such as the paraconsistent and paracomplete logic PŁ4 and BN4 itself are definable, in addition to classical propositional logic. (shrink)

The well-known logic first degree entailment logic (FDE), introduced by Belnap and Dunn, is defined with |$\wedge $|⁠, |$\vee $| and |$\sim $| as the sole primitive connectives. The aim of this paper is to establish the lattice formed by the class of all 4-valued C-extending implicative expansions of FDE verifying the axioms and rules of Routley and Meyer’s basic logic B and its useful disjunctive extension B|$^{\textrm {d}}$|⁠. It is to be noted that Boolean negation (so, classical propositional logic) (...) is definable in the strongest element in the said class. (shrink)

Six interesting variants of the logics BN4 and E4—which can be considered as the 4-valued logics of the relevant conditional and entailment, respectively—were previously developed in the literature. All these systems are related to the family of relevant logics and contain Routley and Meyer's basic logic B, which is well-known to be specifically associated with the ternary relational semantics. The aim of this paper is to develop reduced general Routley-Meyer semantics for them. Strong soundness and completeness theorems are proved for (...) each one of the logics. (shrink)