The logic BN4 was defined by R.T. Brady as a four-valued extension of Routley and Meyer’s basic logic B. The system EF4 is defined as a companion to BN4 to represent the four-valued system of implication. The system Ł was defined by J. Łukasiewicz and it is a four-valued modal logic that validates what is known as strong Łukasiewicz-type modal paradoxes. The systems EF4-M and EF4-Ł are defined as alternatives to Ł without modal paradoxes. This paper aims to define a (...) Belnap-Dunn semantics for EF4, EF4-M and EF4-Ł. It is shown that EF4, EF4-M and EF4-Ł are strongly sound and complete w.r.t. their respective semantics and that EF4-M and EF4-Ł are free from strong Łukasiewicz-type modal paradoxes. (shrink)

Baltag, Moss, and Solecki proposed an expansion of classical modal logic, called logic of epistemic actions and knowledge (EAK), in which one can reason about knowledge and change of knowledge. Kurz and Palmigiano showed how duality theory provides a flexible framework for modeling such epistemic changes, allowing one to develop dynamic epistemic logics on a weaker propositional basis than classical logic (for example an intuitionistic basis). In this paper we show how the techniques of Kurz and Palmigiano can be further (...) extended to define and axiomatize a bilattice logic of epistemic actions and knowledge (BEAK). Our propositional basis is a modal expansion of the well-known four-valued logic of Belnap and Dunn, which is a system designed for handling inconsistent as well as potentially conflicting information. These features, we believe, make our framework particularly promising from a computer science perspective. (shrink)

Quasi-Boolean modal algebras are quasi-Boolean algebras with a modal operator satisfying the interaction axiom. Sequential quasi-Boolean modal logics and the relational semantics are introduced. Kripke-completeness for some quasi-Boolean modal logics is shown by the canonical model method. We show that every descriptive persistent quasi-Boolean modal logic is canonical. The finite model property of some quasi-Boolean modal logics is proved. A cut-free Gentzen sequent calculus for the minimal quasi-Boolean logic is developed and we show that it has the Craig interpolation property.

We provide a complete binary implicational axiomatization of the positive fragment of propositional dynamic logic. The intended application of this result are completeness proofs for non-classical extensions of positive PDL. Two examples are discussed in this article, namely, a paraconsistent extension with modal De Morgan negation and a substructural extension with the residuated operators of the non-associative Lambek calculus. Informal interpretations of these two extensions are outlined.

Epistemic logic is usually employed to model two aspects of a situation: the factual and the epistemic aspects. Truth, however, is not always attainable, and in many cases we are forced to reason only with whatever information is available to us. In this paper, we will explore a four-valued epistemic logic designed to deal with these situations, where agents have only knowledge about the available information, which can be incomplete or conflicting, but not explicitly about facts. This layer of available (...) information or evidence, which is the object of the agents’ knowledge, can be seen as a database. By adopting this sceptical posture in our semantics, we prepare the ground for logics where the notion of knowledge—or more appropriately, belief—is entirely based on evidence. The technical results include a set of reduction axioms for public announcements, correspondence proofs, and a complete tableau system. In summary, our contributions are twofold: on the one hand we present an intuition and possible application for many-valued modal logics, and on the other hand we develop a logic that models the dynamics of evidence in a simple and intuitively clear fashion. (shrink)

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 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.

In this introduction to the special issue “40 years of FDE”, we offer an overview of the field and put the papers included in the special issue into perspective. More specifically, we first present various semantics and proof systems for FDE, and then survey some expansions of FDE by adding various operators starting with constants. We then turn to unary and binary connectives, which are classified in a systematic manner. First-order FDE is also briefly revisited, and we conclude by listing (...) some open problems for future research. (shrink)

Let K be the least normal modal logic and BK its Belnapian version, which enriches K with ‘strong negation’. We carry out a systematic study of the lattice of logics containing BK based on: • introducing the classes of so-called explosive, complete and classical Belnapian modal logics; • assigning to every normal modal logic three special conservative extensions in these classes; • associating with every Belnapian modal logic its explosive, complete and classical counterparts. We investigate the relationships between special extensions (...) and counterparts, provide certain handy characterisations and suggest a useful decomposition of the lattice of logics containing BK. (shrink)

The relationships between various modal logics based on Belnap and Dunn’s paraconsistent four-valued logic FDE are investigated. It is shown that the paraconsistent modal logic \, which lacks a primitive possibility operator \, is definitionally equivalent with the logic \, which has both \ and \ as primitive modalities. Next, a tableau calculus for the paraconsistent modal logic KN4 introduced by L. Goble is defined and used to show that KN4 is definitionally equivalent with \ without the absurdity constant. Moreover, (...) a tableau calculus is defined for the modal bilattice logic MBL introduced and investigated by A. Jung, U. Rivieccio, and R. Jansana. MBL is a generalization of BK that in its Kripke semantics makes use of a four-valued accessibility relation. It is shown that MBL can be faithfully embedded into the bimodal logic \ over the non-modal vocabulary of MBL. On the way from \ to MBL, the Fischer Servi-style modal logic \ is defined as the set of all modal formulas valid under a modified standard translation into first-order FDE, and \ is shown to be characterized by the class of all models for \. Moreover, \ is axiomatized and this axiom system is proved to be strongly sound and complete with respect to the class of models for \. Moreover, the notion of definitional equivalence is suitably weakened, so as to show that \ and \ are weakly definitionally equivalent. (shrink)

Earlier algebraic semantics for Belnapian modal logics were defined in terms of twist-structures over modal algebras. In this paper we introduce the class of BK -lattices, show that this class coincides with the abstract closure of the class of twist-structures, and it forms a variety. We prove that the lattice of subvarieties of the variety of BK -lattices is dually isomorphic to the lattice of extensions of Belnapian modal logic BK . Finally, we describe invariants determining a twist-structure over a (...) modal algebra. (shrink)

We shall be concerned with the modal logic BK—which is based on the Belnap–Dunn four-valued matrix, and can be viewed as being obtained from the least normal modal logic K by adding ‘strong negation’. Though all four values ‘truth’, ‘falsity’, ‘neither’ and ‘both’ are employed in its Kripke semantics, only the first two are expressible as terms. We show that expanding the original language of BK to include constants for ‘neither’ or/and ‘both’ leads to quite unexpected results. To be more (...) precise, adding one of these constants has the effect of eliminating the respective value at the level of BK-extensions. In particular, if one adds both of these, then the corresponding lattice of extensions turns out to be isomorphic to that of ordinary normal modal logics. (shrink)

We determine the modal logic of fixed-point models of truth and their axiomatizations by Solomon Feferman via Solovay-style completeness results. Given a fixed-point model $\mathcal {M}$, or an axiomatization S thereof, we find a modal logic M such that a modal sentence $\varphi $ is a theorem of M if and only if the sentence $\varphi ^*$ obtained by translating the modal operator with the truth predicate is true in $\mathcal {M}$ or a theorem of S under all such translations. (...) To this end, we introduce a novel version of possible worlds semantics featuring both classical and nonclassical worlds and establish the completeness of a family of noncongruent modal logics whose internal logic is nonclassical with respect to this semantics. (shrink)

Łukasiewicz presented two different analyses of modal notions by means of many-valued logics: the linearly ordered systems Ł3,..., Open image in new window,..., \; the 4-valued logic Ł he defined in the last years of his career. Unfortunately, all these systems contain “Łukasiewicz type paradoxes”. On the other hand, Brady’s 4-valued logic BN4 is the basic 4-valued bilattice logic. The aim of this paper is to show that BN4 can be strengthened with modal operators following Łukasiewicz’s strategy for defining truth-functional (...) modal logics. The systems we define lack “Łukasiewicz type paradoxes”. Following Brady, we endow them with Belnap–Dunn type bivalent semantics. (shrink)

The language of Belnap–Dunn modal logic \ expands the language of Belnap–Dunn four-valued logic with the modal operator \. We introduce the polarity semantics for \ and its two expansions \ and \ with value operators. The local finitary consequence relation \ in the language \ with respect to the class of all frames is axiomatized by a sequent system \ where \. We prove by using translations between sequents and formulas that these languages under the polarity semantics have the (...) same expressive power on the level of frames with the language \ under the relational semantics for classical modal logic. (shrink)

We study an extension of first-degree entailment (FDE) by Dunn and Belnap with a non-contingency operator |$\blacktriangle \phi $| which is construed as ‘|$\phi $| has the same value in all accessible states’ or ‘all sources give the same information on the truth value of |$\phi $|’. We equip this logic dubbed |$\textbf {K}^\blacktriangle _{\textbf {FDE}}$| with frame semantics and show how the bi-valued models can be interpreted as interconnected networks of Belnapian databases with the |$\blacktriangle $| operator modelling search (...) for inconsistencies in the provided information. We construct an analytic cut system for the logic and show its soundness and completeness. We prove that |$\blacktriangle $| is not definable via the necessity modality |$\Box $| of |$\textbf {K}_{\textbf{FDE}}$|⁠. Furthermore, we prove that in contrast to the classical non-contingency logic, reflexive, |$\textbf {S4}$| and |$\textbf {S5}$| (among others) frames are definable. (shrink)

In this paper, we argue that the usual approach to modelling knowledge and belief with the necessity modality |$\Box $| does not produce intuitive outcomes in the framework of the Belnap–Dunn logic (⁠|$\textsf{BD}$|⁠, alias |$\textbf{FDE}$|—first-degree entailment). We then motivate and introduce a nonstandard modality |$\blacksquare $| that formalizes knowledge and belief in |$\textsf{BD}$| and use |$\blacksquare $| to define |$\bullet $| and |$\blacktriangledown $| that formalize the unknown truth and ignorance as not knowing whether, respectively. Moreover, we introduce another modality (...) |$\textbf{I}$| that stands for factive ignorance and show its connection with |$\blacksquare $|⁠. We equip these modalities with Kripke-frame-based semantics and construct a sound and complete analytic cut system for |$\textsf{BD}^{\blacksquare }$| and |$\textsf{BD}^{\textbf{I}}$|—the expansions of |$\textsf{BD}$| with |$\blacksquare $| and |$\textbf{I}$|⁠. In addition, we show that |$\Box $| as it is customarily defined in |$\textsf{BD}$| cannot define any of the introduced modalities, nor, conversely, neither |$\blacksquare $| nor |$\textbf{I}$| can define |$\Box $|⁠. We also demonstrate that |$\blacksquare $| and |$\textbf{I}$| are not interdefinable and establish the definability of several important classes of frames using |$\blacksquare $|⁠. (shrink)

A modal extension of multilattice logic, called modal multilattice logic, is introduced as a Gentzen-type sequent calculus \. Theorems for embedding \ into a Gentzen-type sequent calculus S4C and vice versa are proved. The cut-elimination theorem for \ is shown. A Kripke semantics for \ is introduced, and the completeness theorem with respect to this semantics is proved. Moreover, the duality principle is proved as a characteristic property of \.

In this study, we introduce Gentzen-type sequent calculi BDm and BDi for a modal extension and an intuitionistic modification, respectively, of De and Omori’s extended Belnap–Dunn logic BD+ with classical negation. We prove theorems for syntactically and semantically embedding BDm and BDi into Gentzen-type sequent calculi S4 and LJ for normal modal logic and intuitionistic logic, respectively. The cut-elimination, decidability, and completeness theorems for BDm and BDi are obtained using these embedding theorems. Moreover, we prove the Glivenko theorem for embedding (...) BD+ into BDi and the McKinsey–Tarski theorem for embedding BDi into BDm. (shrink)

This study aims to introduce a modal extension M4CC of Arieli, Avron, and Zamansky's ideal paraconsistent four-valued logic 4CC as a Gentzen-type sequent calculus and prove the Kripke-completeness and cut-elimination theorems for M4CC. The logic M4CC is also shown to be decidable and embeddable into the normal modal logic S4. Furthermore, a subsystem of M4CC, which has some characteristic properties that do not hold for M4CC, is introduced and the Kripke-completeness and cut-elimination theorems for this subsystem are proved. This subsystem (...) is also shown to be decidable and embeddable into S4. (shrink)

The tetravalent modal logic is one of the two logics defined by Font and Rius :481–518, 2000) in connection with Monteiro’s tetravalent modal algebras. These logics are expansions of the well-known Belnap–Dunn’s four-valued logic that combine a many-valued character with a modal character. In fact, $${\mathcal {TML}}$$ TML is the logic that preserves degrees of truth with respect to tetravalent modal algebras. As Font and Rius observed, the connection between the logic $${\mathcal {TML}}$$ TML and the algebras is not so (...) good as in $${{\mathcal {TML}}}^N$$ TML N, but, as a compensation, it has a better proof-theoretic behavior, since it has a strongly adequate Gentzen calculus :481–518, 2000). In this work, we prove that the sequent calculus given by Font and Rius does not enjoy the cut-elimination property. Then, using a general method proposed by Avron et al., we provide a sequent calculus for $${\mathcal {TML}}$$ TML with the cut-elimination property. Finally, inspired by the latter, we present a natural deduction system, sound and complete with respect to the tetravalent modal logic. (shrink)

We present novel proof systems for various FDE-based modal logics. Among the systems considered are a number of Belnapian modal logics introduced in Odintsov & Wansing and Odintsov & Wansing, as well as the modal logic KN4 with strong implication introduced in Goble. In particular, we provide a Hilbert-style axiom system for the logic $BK^{\square - } $ and characterize the logic BK as an axiomatic extension of the system $BK^{FS} $. For KN4 we provide both an FDE-style axiom system (...) and a decidable sequent calculus for which a contraction elimination and a cut elimination result are shown. (shrink)

We investigate some non-normal variants of well-studied paraconsistent and paracomplete modal logics that are based on N. Belnap’s and M. Dunn’s four-valued logic. Our basic non-normal modal logics are characterized by a weak extensionality rule, which reflects the four-valued nature of underlying logics. Aside from introducing our basic framework of bi-neighbourhood semantics, we develop a correspondence theory in order to prove completeness results with respect to our neighbourhood semantics for non-normal variants of \, \ and \.

We develop a general theory of FDE-based modal logics. Our framework takes into account the four-valued nature of FDE by considering four partially defined modal operators corresponding to conditions for verifying and falsifying modal necessity and possibility operators. The theory comes with a uniform characterization for all obtained systems in terms of FDE-style formula-formula sequents. We also develop some correspondence theory and show how Hilbert-style axiom systems can be obtained in appropriate cases. Finally, we outline how different systems from the (...) literature can be expressed in our framework. (shrink)