We introduce a paraconsistent modal logic $$\mathbf {K}\mathsf {G}^2$$ , based on Gödel logic with coimplication (bi-Gödel logic) expanded with a De Morgan negation $$\lnot $$ . We use the logic to formalise reasoning with graded, incomplete and inconsistent information. Semantics of $$\mathbf {K}\mathsf {G}^2$$ is two-dimensional: we interpret $$\mathbf {K}\mathsf {G}^2$$ on crisp frames with two valuations $$v_1$$ and $$v_2$$ , connected via $$\lnot $$ , that assign to each formula two values from the real-valued interval [0, 1]. The first (resp., second) valuation encodes the positive (resp., negative) information the state gives to a statement. We obtain that $$\mathbf {K}\mathsf {G}^2$$ is strictly more expressive than the classical modal logic $$\mathbf {K}$$ by proving that finitely branching frames are definable and by establishing a faithful embedding of $$\mathbf {K}$$ into $$\mathbf {K}\mathsf {G}^2$$ . We also construct a constraint tableau calculus for $$\mathbf {K}\mathsf {G}^2$$ over finitely branching frames, establish its decidability and provide a complexity evaluation.
In this paper, we provide a Hilbert-style axiomatization for the crisp bi-Gödel modal logic $\textbf{K}\textsf{biG}$. We prove its completeness w.r.t. crisp Kripke models where formulas at each state are evaluated over the standard bi-Gödel algebra on $[0,1]$. We also consider a paraconsistent expansion of $\textbf{K}\textsf{biG}$ with a De Morgan negation $\neg $, which we dub $\textbf{K}\textsf{G}^{2}$. We devise a Hilbert-style calculus for this logic and, as a consequence of a conservative translation from $\textbf{K}\textsf{biG}$ to $\textbf{K}\textsf{G}^{2}$, prove its completeness w.r.t. crisp Kripke models with two valuations over $[0,1]$ connected via $\neg $. For these two logics, we establish that their decidability and validity are $\textsf{PSPACE}$-complete. We also study the semantical properties of $\textbf{K}\textsf{biG}$ and $\textbf{K}\textsf{G}^{2}$. In particular, we show that Glivenko’s theorem holds only in finitely branching frames. We also explore the classes of formulas that define the same classes of frames both in $\textbf{K}$ (the classical modal logic) and the crisp Gödel modal logic $\mathfrak{G}\mathfrak{K}^{c}$. We show that, among others, all Sahlqvist formulas and all formulas $\phi \rightarrow \chi $ where $\phi $ and $\chi $ are monotone define the same classes of frames in $\textbf{K}$ and $\mathfrak{G}\mathfrak{K}^{c}$.
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.