Abstract
We introduce a paraconsistent modal logic \(\mathbf {K}\mathsf {G}^2\), based on Gödel logic with coimplication (biGö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 twodimensional: 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 realvalued 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.
Keywords
 Constraint tableaux
 Gödel logic
 Twodimensional logics
 Modal logics
The research of Marta Bílková was supported by the grant 2201137S of the Czech Science Foundation. The research of Sabine Frittella and Daniil Kozhemiachenko was funded by the grant ANR JCJC 2019, project PRELAP (ANR19CE480006). This research is part of the MOSAIC project financed by the European Union’s Marie SkłodowskaCurie grant No. 101007627.
Download conference paper PDF
1 Introduction
People believe in many things. Sometimes, they even have contradictory beliefs. Sometimes, they believe in one statement more than in the other. However, if a person has contradictory beliefs, they are not bound to believe in anything. Likewise, believing in \(\phi \) strictly more than in \(\chi \) makes one believe in \(\phi \) completely. These properties of beliefs are natural, and yet hardly expressible in the classical modal logic. In this paper, we present a twodimensional modal logic based on Gödel logic that can formalise beliefs taking these traits into account.
TwoDimensional Treatment of Uncertainty. BelnapDunn fourvalued logic (\(\textsf {BD}\), or First Degree Entailment—\(\textsf {FDE}\)) [4, 16, 34] can be used to formalise reasoning with both incomplete and inconsistent information. In \(\textsf {BD}\), formulas are evaluated on the De Morgan algebra \(\mathbf {4}\) (Fig. 1, left) where the four values \(\{t,f,b,n\}\) encode the information available about the formula: true, false, both true and false, neither true nor false. b and n thus represent inconsistent and incomplete information, respectively. It is important to note that the values represent the available information about the statement, not its intrinsic truth or falsity. Furthermore, this approach essentially treats evidence for a statement (its positive support) as being independent of evidence against it (negative support) which allows to differentiate between ‘absence of evidence’ and the ‘evidence of absence’. The \(\textsf {BD}\) negation \(\lnot \) then swaps positive and negative supports.
The information regarding a statement, however, might itself be not crisp—after all, our sources are not always completely reliable. Thus, to capture the uncertainty, we extend \(\mathbf {4}\) to the lattice (Fig. 1, right). is a twist product (cf, [37] for definitions) of [0, 1] with itself: the order on the second coordinate is reversed w.r.t. the order on the first coordinate. This captures the intuition behind the usual ‘truth’ (upwards) order: an agent is more certain in \(\chi \) than in \(\phi \) when the evidence for \(\chi \) is stronger than the evidence for \(\phi \) while the evidence against \(\chi \) is weaker than the evidence against \(\phi \).
Note that is a bilattice whose lefttoright order can be interpreted as the information order. This links the logics we consider to bilattice logics applied to reasoning in AI in [19] and then studied further in [24, 35].
Comparing Beliefs. Uncertainty is manifested not only in the noncrisp character of the information. An agent might often lack the capacity to establish the concrete numerical value that represents their certainty in a given statement. Indeed, ‘I am 43% certain that the wallet is Paula’s’ does not sound natural. On the other hand, it is reasonable to assume that the agents’ beliefs can be compared in most contexts: neither ‘I am more confident that the wallet is Paula’s than that the wallet is Quentin’s’, nor ‘Alice is more certain than Britney that Claire loves pistachio ice cream’ require us to give a concrete numerical representation to the (un)certainty.
These considerations lead us to choosing the twodimensional relative of the Gödel logic dubbed \(\mathsf {G}^2\) as the propositional fragment of our logic. \(\mathsf {G}^2\) was introduced in [5] and is, in fact, an extension of Moisil’s logic^{Footnote 1} from [31] with the prelinearity axiom \((p\rightarrow q)\vee (q\rightarrow p)\). As in the original Gödel logic \(\mathsf {G}\), the validity of a formula in \(\mathsf {G}^2\) depends not on the values of its constituent variables but on the relative order between them. In this sense, \(\mathsf {G}\) is a logic of comparative truth. Thus, as we treat positive and negative supports of a given statement independently, \(\mathsf {G}^2\) is a logic of comparative truth and falsity. Note that while the values of two statements may not be comparable (say, p is evaluated as (0.5, 0.3) and q as (0, 0)), the coordinates of the values always are. We will see in Sect. 2, how we can formalise statements comparing agents’ beliefs.
The sources available to the agents as well as the references between these sources can be represented as states in a Kripke model and its accessibility relation, respectively. It is important to mention that we account for the possibility that a source can give us contradictory information regarding some statement. Still, we want our reasoning with such information to be nontrivial. This is reflected by the fact that \((p\wedge \lnot p)\rightarrow q\) is not valid in \(\mathsf {G}^2\). Thus, the logic (treated as a set of valid formulas) lacks the explosion principle. In this sense, we call \(\mathsf {G}^2\) and its modal expansions ‘paraconsistent’. This links our approach to other paraconsistent fuzzy logics such as the ones discussed in [17].
To reason with the information provided by the sources, we introduce two interdefinable modalities—\(\Box \) and \(\lozenge \)—interpreted as infima and suprema w.r.t. the upwards order on . We mostly assume (unless stated otherwise) that accessibility relations in models are crisp. Intuitively, it means that the sources are either accessible or not (and, likewise, either refer to the other ones, or not).
Broader Context. This paper is a part of the project introduced in [6] and carried on in [5] aiming to develop a modular logical framework for reasoning based on uncertain, incomplete and inconsistent information. We model agents who build their epistemic attitudes (like beliefs) based on information aggregated from multiple sources. \(\Box \) and \(\lozenge \) can be then viewed as two simple aggregation strategies: a pessimistic one (the infimum of positive support and the supremum of the negative support), and an optimistic one (the dual strategy), respectively. They can be defined via one another using \(\lnot \) in the expected manner: \(\Box \phi \) stands for \(\lnot \lozenge \lnot \phi \) and \(\lozenge \phi \) for \(\lnot \Box \lnot \phi \). In this paper, in contrast to [15] and [6], we do allow for modalities to nest.
The other part of our motivation comes from the work on modal Gödel logic (\(\mathfrak {GK}\)—in the notation of [36]) equipped with relational semantics [12, 13, 36]. There, the authors develop proof and model theory of modal expansions of \(\mathsf {G}\) interpreted over frames with both crisp and fuzzy accessibility relations. In particular, it was shown that the \(\Box \)fragment^{Footnote 2} of \(\mathfrak {GK}\) lacks the finite model property (FMP) w.r.t. fuzzy frames while the \(\lozenge \)fragment has FMP^{Footnote 3} only w.r.t. fuzzy (but not crisp) frames. Furthermore, both \(\Box \) and \(\lozenge \) fragments of \(\mathfrak {GK}\) are PSPACEcomplete [28, 29].
Description Gödel logics, a notational version of modal logics, have found their use the field of knowledge representation [8,9,10], in particular, in the representation of vague or uncertain data which is not possible in the classical ontologies. In this respect, our paper provides a further extension of representable data types as we model not only vague reasoning but also nontrivial reasoning with inconsistent information.
In the present paper, we are expanding the language with the Gödel coimplication to allow for the formalisation of statements expressing that an agent is strictly more confident in one statement than in another one (cf. Sect. 2 for the details). Furthermore, the presence of \(\lnot \) will allow us to simplify the frame definability. Still, we will show that our logic is a conservative extension of \(\mathfrak {GK}^c\)—the modal Gödel logic of crisp frames from [36] in the language with both \(\Box \) and \(\lozenge \).
Logics. We are discussing many logics obtained from the propositional Gödel logic \(\mathsf {G}\). Our main interest is in the logic we denote \(\mathbf {K}\mathsf {G}^2\). It can be produced from \(\mathsf {G}\) in several ways: (1) adding De Morgan negation \(\lnot \) to obtain \(\mathsf {G}^2\) (in which case can be defined as \(\lnot (\lnot \phi '\rightarrow \lnot \phi )\)) and then further expanding the language with \(\Box \) or \(\lozenge \); (2) adding or \(\varDelta \) (Baaz’ delta) to \(\mathsf {G}\), then both \(\Box \) and \(\lozenge \) thus acquiring \(\mathbf {K}\mathsf {biG}\)^{Footnote 4} (modal biGödel logic) which is further enriched with \(\lnot \). These and other relations are given on Fig. 2.
Plan of the Paper. The remainder of the paper is structured as follows. In Sect. 2, we define biGödel algebras and use them to present \(\mathbf {K}\mathsf {biG}\) (on both fuzzy and crisp frames) and then \(\mathbf {K}\mathsf {G}^2\) (on crisp frames), show how to formalise statements where beliefs of agents are compared, and prove some semantical properties. In Sect. 3, we show that \(\lozenge \) fragment of \(\mathbf {K}\mathsf {biG}^\mathsf {f}\) (\(\mathbf {K}\mathsf {biG}\) on fuzzy frames) lacks finite model property. We then present a finitely branching fragment of \(\mathbf {K}\mathsf {G}^2\) (\(\mathbf {K}\mathsf {G}^2_{\mathsf {fb}}\)) and argue for its use in representation of agents’ beliefs. In Sect. 4, we design a constraint tableaux calculus for \(\mathbf {K}\mathsf {G}^2_{\mathsf {fb}}\) which we use to obtain the complexity results. Finally, in Sect. 5 we discuss further lines of research.
2 Language and Semantics
In this section, we present semantics for \(\mathbf {K}\mathsf {biG}\) (modal biGödel logic) over both fuzzy and crisp frames and the one for \(\mathbf {K}\mathsf {G}^2\) over crisp frames. Let \(\mathsf {Var}\) be a countable set of propositional variables. The language \(\mathsf {bi}\mathcal {L}^\lnot _{\Box ,\lozenge }\) is defined via the following grammar.
Two constants, \(\mathbf {0}\) and \(\mathbf {1}\), can be introduced in the traditional fashion: , \(\mathbf {1}:= p\rightarrow p\). Likewise, the Gödel negation can be also defined as expected: \({\sim }\phi :=\phi \rightarrow \mathbf {0}\). The \(\lnot \)less fragment of \(\mathsf {bi}\mathcal {L}^\lnot _{\Box ,\lozenge }\) is denoted with \(\mathsf {bi}\mathcal {L}_{\Box ,\lozenge }\).
To facilitate the presentation, we introduce biGödel algebras.
Definition 1
The biGödel algebra is defined as follows: for all \(a,b\in [0,1]\), the standard operations are given by \(a\wedge _\mathsf {G}b:=\min (a,b)\), \(a\vee _\mathsf {G}b:=\max (a,b)\),
Definition 2

A fuzzy frame is a tuple \(\mathfrak {F}=\langle W,R\rangle \) with \(W\ne \varnothing \) and \(R:W\times W\rightarrow [0,1]\).

A crisp frame is a tuple \(\mathfrak {F}=\langle W,R\rangle \) with \(W\ne \varnothing \) and \(R\subseteq W\times W\).
Definition 3
(\(\mathbf {K}\mathsf {biG}\) models). A \(\mathbf {K}\mathsf {biG}\) model is a tuple \(\mathfrak {M}=\langle W,R,v\rangle \) with \(\langle W,R\rangle \) being a (crisp or fuzzy) frame, and \(v:\mathsf {Var}\times W\rightarrow [0,1]\). v (a valuation) is extended on complex \(\mathsf {bi}\mathcal {L}_{\Box ,\lozenge }\) formulas as follows:
The interpretation of modal formulas on fuzzy frames is as follows:
On crisp frames, the interpretation is simpler (here, \(\inf (\varnothing )\!=\!1\) and \(\sup (\varnothing )\!=\!0\)):
We say that \(\phi \in \mathsf {bi}\mathcal {L}_{\Box ,\lozenge }\) is \(\mathbf {K}\mathsf {biG}\) valid on frame \(\mathfrak {F}\) (denote, \(\mathfrak {F}\models _{\mathbf {K}\mathsf {biG}}\phi \)) iff for any \(w\in \mathfrak {F}\), it holds that \(v(\phi ,w)=1\) for any model \(\mathfrak {M}\) on \(\mathfrak {F}\).
Note that the definitions of validity in \(\mathfrak {GK}^c\) and \(\mathfrak {GK}\) coincide with those in \(\mathbf {K}\mathsf {biG}\) and \(\mathbf {K}\mathsf {biG}^\mathsf {f}\) if we consider the free fragment of \(\mathsf {bi}\mathcal {L}_{\Box ,\lozenge }\).
As we have already mentioned, on crisp frames, the accessibility relation can be understood as availability of (trusted or reliable) sources. In fuzzy frames, it can be thought of as the degree of trust one has in a source. Then, \(\lozenge \phi \) represents the search for evidence from trusted sources that supports \(\phi \): \(v(\lozenge \phi ,t)>0\) iff there is \(t'\) s.t. \(tRt'>0\) and \(v(\phi ,t')>0\), i.e., there must be a source \(t'\) to which t has positive degree of trust and that has at least some certainty in \(\phi \). On the other hand, if no source is trusted by t (i.e., \(tRu=0\) for all u), then \(v(\lozenge \phi ,t)=0\). Likewise, \(\Box \chi \) can be construed as the search of evidence against \(\chi \) given by trusted sources: \(v(\Box \chi ,t)<1\) iff there is a source \(t'\) that gives to \(\chi \) less certainty than t gives trust to \(t'\). In other words, if t trusts no sources, or if all sources have at least as high confidence in \(\chi \) as t has in them, then t fails to find a trustworthy enough counterexample.
Definition 4
(\(\mathbf {K}\mathsf {G}^2\) models). A \(\mathbf {K}\mathsf {G}^2\) model is a tuple \(\mathfrak {M}=\langle W,R,v_1,v_2\rangle \) with \(\langle W,R\rangle \) being a crisp frame, and \(v_1,v_2:\mathsf {Var}\times W\rightarrow [0,1]\). The valuations which we interpret as support of truth and support of falsity, respectively, are extended on complex formulas as expected.
We say that \(\phi \in \mathsf {bi}\mathcal {L}^\lnot _{\Box ,\lozenge }\) is \(\mathbf {K}\mathsf {G}^2\) valid on frame \(\mathfrak {F}\) (\(\mathfrak {F}\models _{\mathbf {K}\mathsf {G}^2}\phi \)) iff for any \(w\in \mathfrak {F}\), it holds that \(v_1(\phi ,w)=1\) and \(v_2(\phi ,w)=0\) for any model \(\mathfrak {M}\) on \(\mathfrak {F}\).
Convention 1
In what follows, we will denote a pair of valuations \(\langle v_1,v_2\rangle \) just with v if there is no risk of confusion. Furthermore, for each frame \(\mathfrak {F}\) and each \(w\in \mathfrak {F}\), we denote
Convention 2
We will further denote with \(\mathbf {K}\mathsf {biG}\) the set of all formulas \(\mathbf {K}\mathsf {biG}\)valid on all crisp frames; \(\mathbf {K}\mathsf {biG}^\mathsf {f}\) the set of all formulas \(\mathbf {K}\mathsf {biG}\)valid on all fuzzy frames; and \(\mathbf {K}\mathsf {G}^2\)—the set of all formulas \(\mathbf {K}\mathsf {G}^2\) valid on all crisp frames.
Before proceeding to establish some semantical properties, let us make two remarks. First, neither \(\Box \) nor \(\lozenge \) are trivialised by contradictions: in contrast to \(\mathbf {K}\), \(\Box (p\wedge \lnot p)\rightarrow \Box q\) is not \(\mathbf {K}\mathsf {G}^2\) valid, and neither is \(\lozenge (p\wedge \lnot p)\rightarrow \lozenge q\). Intuitively, this means that one can have contradictory but nontrivial beliefs. Second, we can formalise statements of comparative belief such as the ones we have already given before:
wallet: I am more confident that the wallet is Paula’s than that the wallet is Quentin’s.
ice cream: Alice is more certain than Britney that Claire loves pistachio ice cream.
For this, consider the following defined operators.
It is clear that for any \(\tau \in \mathsf {bi}\mathcal {L}_{\Box ,\lozenge }\) and \(\phi \in \mathsf {bi}\mathcal {L}^\lnot _{\Box ,\lozenge }\) interpreted on \(\mathbf {K}\mathsf {biG}\) and \(\mathbf {K}\mathsf {G}^2\) models, respectively, it holds that
Now we can define formulas that express order relations between values of two formulas both for \(\mathbf {K}\mathsf {biG}\) and \(\mathbf {K}\mathsf {G}^2\).
For \(\mathbf {K}\mathsf {biG}\) they look as follows:
In \(\mathbf {K}\mathsf {G}^2\), the orders are defined in a more complicated way:
Observe, first, that both in \(\mathbf {K}\mathsf {biG}\) and \(\mathbf {K}\mathsf {G}^2\) the relation ‘the value of \(\tau \) (\(\phi \)) is less or equal to the value of \(\tau '\) (\(\phi '\))’ is defined as ‘\(\tau \rightarrow \tau '\) (\(\phi \rightarrow \phi '\)) has the designated value’. In \(\mathbf {K}\mathsf {biG}\), the strict order is just a negation of the nonstrict order since all values are comparable. On the other hand, in contrast to \(\mathbf {K}\mathsf {biG}\), the strict order in \(\mathbf {K}\mathsf {G}^2\) is not a simple negation of the nonstrict order since \(\mathbf {K}\mathsf {G}^2\) is essentially twodimensional. We provide further details in Remark 2.
Finally, we can formalise \(\mathsf {wallet}\) as follows. We interpret ‘I am confident’ as \(\Box \) and substitute ‘the wallet is Paula’s’ with p, and ‘the wallet is Quentin’s’ with q. Now, we just use the definition of > in \(\mathsf {bi}\mathcal {L}^\lnot _{\Box ,\lozenge }\) to get
For ice cream, we need two different modalities: \(\Box _a\) and \(\Box _b\) for Alice and Brittney, respectively. Replacing ‘Alice loves pistachio ice cream’ with p, we get
Remark 1
\(\varDelta \) is called Baaz’ delta (cf., e.g. [3] for more details). Intuitively, \(\varDelta \tau \) can be interpreted as ‘\(\tau \) has the designated value’ and acts much like a necessity modality: if \(\tau \) is \(\mathbf {K}\mathsf {biG}\) valid, then so is \(\varDelta \tau \); moreover, \(\varDelta (p\rightarrow q)\rightarrow (\varDelta p\rightarrow \varDelta q)\) is valid. Furthermore, \(\varDelta \) and can be defined via one another in \(\mathbf {K}\mathsf {biG}\), thus the addition of \(\varDelta \) to \(\mathsf {G}\) makes it more expressive and allows to define both strict and nonstrict orders.
Remark 2
Recall that we mentioned in Sect. 1 that an agent should usually be able to compare their beliefs in different statements: this is reflected by the fact that \(\varDelta (p\rightarrow q)\vee \varDelta (q\rightarrow p)\) is \(\mathbf {K}\mathsf {biG}\) valid. It can be counterintuitive if the contents of beliefs have nothing in common, however.
This drawback is avoided if we treat support of truth and support of falsity independently. Here is where a difference between \(\mathbf {K}\mathsf {biG}\) and \(\mathbf {K}\mathsf {G}^2\) lies. In \(\mathbf {K}\mathsf {G}^2\), we can only compare the values of formulas coordinatewise, whence \(\varDelta ^\lnot (p\rightarrow q)\vee \varDelta ^\lnot (q\rightarrow p)\) is not \(\mathbf {K}\mathsf {G}^2\) valid. E.g., if we set \(v(p,w)=(0.7,0.6)\) and \(v(q,w)=(0.4,0.2)\), v(p, w) and v(q, w) will not be comparable w.r.t. the truth (upward) order on .
We end this section with establishing some useful semantical properties.
Proposition 1
\(\mathfrak {F}\models _{\mathbf {K}\mathsf {G}^2}\!\phi \) iff for any model \(\mathfrak {M}\) on \(\mathfrak {F}\) and any \(w\!\in \!\mathfrak {F}\), \(v_1(\phi ,w)\!=\!1\).
Proof
The ‘if’ direction is evident from the definition of validity. We show the ‘only if’ part. It suffices to show that the following statement holds for any \(\phi \) and \(w\in \mathfrak {F}\):
for any \(v(p,w)=(x,y)\), let \(v^*(p,w)=(1y,1x)\). Then \(v(\phi ,w)=(x,y)\) iff \(v^*(\phi ,w)=(1y,1x)\).
We proceed by induction on \(\phi \). The proof of propositional cases is identical to the one in [5, Proposition 5]. We consider only the case of \(\phi =\Box \psi \) since \(\Box \) and \(\lozenge \) are interdefinable.
Let \(v(\Box \psi ,w)=(x,y)\). Then \(\inf \{v_1(\psi ,w'):wRw'\}=x\), and \(\sup \{v_2(\psi ,w'):wRw'\}=y\). Now, we apply the induction hypothesis to \(\psi \), and thus if \(v(\psi ,s)=(x',y')\), then \(v^*(\psi ,s)=(1y',1x')\) for any \(s\in R(w)\). But then \(\inf \{v^*_1(\psi ,w'):wRw'\}=1y\), and \(\sup \{v^*_2(\psi ,w'):wRw'\}=1x\) as required.
Now, assume that \(v_1(\phi ,w)=1\) for any \(v_1\) and w. We can show that \(v_2(\phi ,w)\!=\!0\) for any w and \(v_2\). Assume for contradiction that \(v_2(\phi ,w)\!=\!y\!>\!0\) but \(v_1(\phi ,w)\!=\!1\). Then, \(v^*(\phi )\!=\!(1\!\!y,1\!\!1)\!=\!(1\!\!y,0)\). But since \(y\!>\!0\), \(v^*(\phi )\!\ne \!(1,0)\).
Proposition 2

1.
Let \(\phi \) be a formula over \(\{\mathbf {0},\wedge ,\vee ,\rightarrow ,\Box ,\lozenge \}\). Then, \(\mathfrak {F}\models _{\mathfrak {GK}}\phi \) iff \(\mathfrak {F}\models _{\mathbf {K}\mathsf {biG}^\mathsf {f}}\phi \) and \(\mathfrak {F}\models _{\mathfrak {GK}^c}\phi \) iff \(\mathfrak {F}\models _{\mathbf {K}\mathsf {biG}}\phi \), for any \(\mathfrak {F}\).

2.
Let \(\phi \in \mathsf {bi}\mathcal {L}_{\Box ,\lozenge }\). Then, \(\mathfrak {F}\models _{\mathbf {K}\mathsf {biG}}\phi \) iff \(\mathfrak {F}\models _{\mathbf {K}\mathsf {G}^2}\phi \), for any crisp \(\mathfrak {F}\).
Proof
1. follows directly from the semantic conditions of Definition 3. We consider 2. The ‘only if’ direction is straightforward since the semantic conditions of \(v_1\) in \(\mathbf {K}\mathsf {G}^2\) models and v in \(\mathbf {K}\mathsf {biG}\) models coincide. The ‘if’ direction follows from Proposition 1: if \(\phi \) is valid on \(\mathfrak {F}\), then \(v(\phi ,w)=1\) for any \(w\in \mathfrak {F}\) and any v on \(\mathfrak {F}\). But then, \(v_1(\phi ,w)=1\) for any \(w\in \mathfrak {F}\). Hence, \(\mathfrak {F}\models _{\mathbf {K}\mathsf {G}^2}\phi \).
3 ModelTheoretic Properties of \(\mathbf {K}\mathsf {G}^2\)
In the previous section, we have seen how the addition of allowed us to formalise statements considering comparison of beliefs. Here, we will show that both \(\Box \) and \(\lozenge \) fragments of \(\mathbf {K}\mathsf {biG}\), and hence \(\mathbf {K}\mathsf {G}^2\), are strictly more expressive than the classical modal logic \(\mathbf {K}\), i.e. that they can define all classically definable classes of crisp frames as well as some undefinable ones.
Definition 5 (Frame definability)
Let \(\varSigma \) be a set of formulas. \(\varSigma \) defines a class of frames \(\mathbb {K}\) in a logic \(\mathbf {L}\) iff it holds that \(\mathfrak {F}\in \mathbb {K}\) iff \(\mathfrak {F}\models _\mathbf {L}\varSigma \).
The next statement follows from Proposition 2 since \(\mathbf {K}\) can be faithfully embedded in \(\mathfrak {GK}^c\) by substituting each variable p with \({\sim \sim }p\) (cf. [28, 29] for details).
Theorem 1
Let \(\mathbb {K}\) be a class of frames definable in \(\mathbf {K}\). Then, \(\mathbb {K}\) is definable in \(\mathbf {K}\mathsf {biG}\) and \(\mathbf {K}\mathsf {G}^2\).
Theorem 2

1.
Let \(\mathfrak {F}\) be crisp. Then \(\mathfrak {F}\) is finitely branching (i.e., R(w) is finite for every \(w\in \mathfrak {F}\)) iff .

2.
Let \(\mathfrak {F}\) be fuzzy. Then \(\mathfrak {F}\) is finitely branching and \(\sup \{wRw':wRw'<1\}<1\) for all \(w\in \mathfrak {F}\) iff .
Proof
We show the case of fuzzy frames since the crisp ones can be tackled in the same manner. Assume that \(\mathfrak {F}\) is finitely branching and that \(\sup \{wRw'\!:\!wRw'\!<\!1\}<1\) for all \(w\in \mathfrak {F}\). It suffices to show that for all \(w\in \mathfrak {F}\). First of all, observe that there is no \(w'\in \mathfrak {F}\) s.t. . It is clear that and that
since R(w) is finite. But then as required.
For the converse, either (1) R(w) is infinite for some w, or (2) \(\sup \{wRw':wRw'<1\}=1\) for some w. For (1), set \(v(p,w')=1\) for every \(w'\in R(w)\). Now let \(W'\subseteq R(w)\) and \(W'=\{w_i:i\in \{1,2,\ldots \}\}\). We set \(v(q,w_i)=\frac{i}{i+1}\). It is easy to see that \(\sup \{v(q,w_i):w_i\in W'\}=1\) and that . Therefore, .
For (2), we let \(v(p,w')=1\) and further, \(v(q,w')=wRw'\) for all \(w'\in \mathfrak {F}\). Now since \(\sup \{wRw':wRw'<1\}=1\) and for all \(w'\in \mathfrak {F}\), it follows that , whence .
Remark 3
The obvious corollary of Theorem 2 is the lack of FMP for the \(\lozenge \)fragment of \(\mathbf {K}\mathsf {biG}^\mathsf {f}\)^{Footnote 5} since in never true in a finite model. This differentiates \(\mathbf {K}\mathsf {biG}^\mathsf {f}\) from \(\mathfrak {GK}\) since the \(\lozenge \)fragment of \(\mathfrak {GK}\) has FMP [12, Theorem 7.1]. Moreover, one can define finitely branching frames in \(\Box \) fragments of \(\mathfrak {GK}\) and \(\mathfrak {GK}^c\). Indeed, \({\sim \sim }\Box (p\vee {\sim }p)\) serves as such definition.
Corollary 1
\(\mathbf {K}\mathsf {G}^2\) and both \(\Box \) and \(\lozenge \) fragments of \(\mathbf {K}\mathsf {biG}\) are strictly more expressive than \(\mathbf {K}\).
Proof
From Theorems 1 and 2 since \(\mathbf {K}\) is complete both w.r.t. all frames and all finitely branching frames. The result for \(\mathbf {K}\mathsf {G}^2\) follows since it is conservative over \(\mathbf {K}\mathsf {biG}\) (Proposition 2).
These results show us that addition of greatly enhances the expressive power of our logic. Here it is instructive to remind ourselves that classical epistemic logics are usually complete w.r.t. finitely branching frames (cf. [18] for details). It is reasonable since for practical reasoning, agents cannot consider infinitely many alternatives. In our case, however, if we wish to use \(\mathbf {K}\mathsf {biG}\) and \(\mathbf {K}\mathsf {G}^2\) for knowledge representation, we need to impose finite branching explicitly.
Furthermore, allowing for infinitely branching frames in \(\mathbf {K}\mathsf {biG}\) or \(\mathbf {K}\mathsf {G}^2\) leads to counterintuitive consequences. In particular, it is possible that \(v(\Box \phi ,w)=(0,1)\) even though there are no \(w',w''\in R(w)\) s.t. \(v_1(\phi ,w')=0\) or \(v_2(\phi ,w'')=1\). In other words, there is no source that decisively falsifies \(\phi \), furthermore, all sources have some evidence for \(\phi \), and yet we somehow believe that \(\phi \) is completely false and untrue. Dually, it is possible that \(v(\lozenge \phi ,w)=(1,0)\) although there are no \(w',w''\in R(w)\) s.t. \(v_1(\phi ,w')=1\) or \(v_2(\phi ,w'')=0\). Even though \(\lozenge \) is an ‘optimistic’ aggregation, it should not ignore the fact that all sources have some evidence against \(\phi \) but none supports it completely.
Of course, this situation is impossible if we consider only finitely branching frames for infima and suprema will become minima and maxima. There, all values of modal formulas will be witnessed by some accessible states in the following sense. For \(\heartsuit \in \{\Box ,\lozenge \}\), \(i\in \{1,2\}\), if \(v_i(\heartsuit \phi ,w)=x\), then there is \(w'\in R(w)\) s.t. \(v_i(\phi ,w')=x\). Intuitively speaking, finitely branching frames represent the situation when our degree of certainty in some statement is based uniquely on the data given by the sources.
Convention 3
We will further use \(\mathbf {K}\mathsf {biG}_{\mathsf {fb}}\) and \(\mathbf {K}\mathsf {G}^2_{\mathsf {fb}}\) to denote the sets of all \(\mathsf {bi}\mathcal {L}_{\Box ,\lozenge }\) and \(\mathsf {bi}\mathcal {L}^\lnot _{\Box ,\lozenge }\) formulas valid on finitely branching crisp frames.
Observe, moreover, that \(\Box \) and \(\lozenge \) are still undefinable via one another in \(\mathsf {bi}\mathcal {L}_{\Box ,\lozenge }\). The proof is the same as that of [36, Lemma 6.1].
Proposition 3
\(\Box \) and \(\lozenge \) are not interdefinable in \(\mathbf {K}\mathsf {biG}_{\mathsf {fb}}\).
Corollary 2

1.
\(\Box \) and \(\lozenge \) are not interdefinable in \(\mathbf {K}\mathsf {biG}\), \(\mathbf {K}\mathsf {biG}_{\mathsf {fb}}^\mathsf {f}\), and \(\mathbf {K}\mathsf {biG}^\mathsf {f}\).

2.
Both \(\Box \) and \(\lozenge \) fragments of \(\mathbf {K}\mathsf {biG}\) are more expressive than \(\mathbf {K}\).
In the remainder of the paper, we are going to provide a complete proof system for \(\mathbf {K}\mathsf {G}^2_{\mathsf {fb}}\) (and hence, \(\mathbf {K}\mathsf {biG}_{\mathsf {fb}}\)), and establish its decidability and complexity as well as finite model property. Note, however, that the latter is not entirely for granted. In fact, several expected ways of defining filtration (cf. [7, 14] for more details thereon) fail.
Let \(\varSigma \subseteq \mathsf {bi}\mathcal {L}_{\Box ,\lozenge }\) be closed under subformulas. If we want to have filtration for \(\mathbf {K}\mathsf {biG}_{\mathsf {fb}}\), there are three intuitive ways to define \(\sim _\varSigma \) on the carrier of a model that is supposed to relate states satisfying the same formulas.

1.
\(w\sim ^1_\varSigma w'\) iff \(v(\phi ,w)=v(\phi ,w')\) for all \(\phi \in \varSigma \).

2.
\(w\sim ^2_\varSigma w'\) iff \(v(\phi ,w)=1\Leftrightarrow v(\phi ,w')=1\) for all \(\phi \in \varSigma \).

3.
\(w\sim ^3_\varSigma w'\) iff \(v(\phi ,w)\le v(\phi ',w)\Leftrightarrow v(\phi ,w')\le v(\phi ',w')\) for all \(\phi ,\phi '\!\in \!\varSigma \!\cup \!\{\mathbf {0},\!\mathbf {1}\}\).
Consider the model on Fig. 3 and two formulas:
Now let \(\varSigma \) to be the set of all subformulas of \(\phi ^\le \wedge \phi ^>\).
First of all, it is clear that \(v(\phi ^\le \wedge \phi ^>,w)=1\) for any \(w\in \mathfrak {M}\). Observe now that all states in \(\mathfrak {M}\) are distinct w.r.t. \(\sim ^1_\varSigma \). Thus, the first way of constructing the carrier of the new model does not give the FMP.
As regards to \(\sim ^2_\varSigma \) and \(\sim ^3_\varSigma \), one can check that for any \(w,w'\in \mathfrak {M}\), it holds that \(w\sim ^2_\varSigma w'\) and \(w\sim ^3_\varSigma w'\). So, if we construct a filtration of \(\mathfrak {M}\) using equivalence classes of either of these two relations, the carrier of the resulting model is going to be finite. Even more so, it is going to be a singleton.
However, we can show that there is no finite model \(\mathfrak {N}=\langle U,S,e\rangle \) s.t.
Indeed, \(e(\phi ^\le ,t)=1\) iff \(e(p,t')>0\) for some \(t'\in S(t)\), while \(e(\phi ^>,t)=1\) iff \(v(p,t)>v(p,t')\) for any \(t'\in S(t)\). Now, if U is finite, we have two options: either (1) there is \(u\in U\) s.t. \(R(u)=\varnothing \), or (2) U contains a finite Scycle.
For (1), note that \(v(\lozenge p,u)=0\), and we have two options: if \(e(p,u)=0\), then \(e(\phi ^>,u)=0\); if, on the other hand, \(e(p,u)>0\), then \(e(\phi ^\le ,u)=0\). For (2), assume w.l.o.g. that the Scycle looks as follows: \(u_0Su_1Su_2\ldots Su_nSu_0\).
If \(e(p,u_0)\!=\!0\), \(e(\phi ^>,u_0)\!=\!0\), so \(e(p,u_0)\!>\!0\). Furthermore, \(e(p,u_i)\!>\!e(p,u_{i+1})\). Otherwise, again, \(e(\phi ^>,u_i)=0\). But then we have \(e(\phi ^>,u_i)=0\).
But this means that \(\sim ^2_\varSigma \) and \(\sim ^3_\varSigma \) do not preserve truth of formulas from w to \([w]_\varSigma \), i.e., neither of these two relations can be used to define filtration. Thus, in order to explicitly prove the finite model property and establish complexity evaluations for \(\mathbf {K}\mathsf {biG}_{\mathsf {fb}}\) and \(\mathbf {K}\mathsf {G}^2_{\mathsf {fb}}\), we will provide a tableaux calculus. It will also serve as a decision procedure for satisfiability and validity of formulas.
4 Tableaux for \(\mathbf {K}\mathsf {G}^2_{\mathsf {fb}}\)
Usually, proof theory for modal and manyvalued logics is presented in one of the following several forms. The first one is a Hilbertstyle axiomatisation as given in e.g. [23] for the propositional Gödel logic and in [12, 13, 36] for its modal expansions. Hilbert calculi are useful for establishing frame correspondence results as well as for showing that one logic extends another one in the same language. On the other hand, their completeness proofs might be quite complicated, and the proofsearch not at all straightforward. Second, there are nonlabelled sequent and hypersequent calculi (cf. [30] for the propositional proof systems and [28, 29] for the modal hypersequent calculi). With regards to modal logics, completeness proofs of (hyper)sequent calculi often provide the answer for the decidability problem. Furthermore, the proof search can be quite straightforwardly automatised provided that the calculus is cutfree.
Finally, there are proof systems that directly incorporate semantics: in particular, tableaux (e.g., the ones for Gödel logics [2] and tableaux for Łukasiewicz description logic [25]) and labelled sequent calculi (cf., e.g. [32] for labelled sequent calculi for classical modal logics). Because of the calculi’s nature, their completeness proofs are usually simple. Besides, the calculi serve as a decision procedure that either establishes that the given formula is valid or provides an explicit countermodel.
Our tableaux system \(\mathcal {T}\!\left( \mathbf {K}\mathsf {G}^2_{\mathsf {fb}}\right) \) is a straightforward modal expansion of constraint tableaux for \(\mathsf {G}^2\) presented in [5]. It is inspired by constraint tableaux for Łukasiewicz logics from [21, 22] (but cf. [26] for an approach similar to ours) which we modify with twosorted labels corresponding to the support of truth and support of falsity in the model. This idea comes from tableaux for the Belnap—Dunn logic by D’Agostino [1]. Moreover, since \(\mathbf {K}\mathsf {G}^2_{\mathsf {fb}}\) is a conservative extension of \(\mathbf {K}\mathsf {biG}_{\mathsf {fb}}\), our calculus can be used for that logic as well if we apply only the rules that govern the support of truth of \(\mathsf {bi}\mathcal {L}_{\Box ,\lozenge }\) formulas.
Definition 6
(\(\mathcal {T}\!\left( \mathbf {K}\mathsf {G}^2_{\mathsf {fb}}\right) \)). We fix a set of statelabels \(\mathsf {W}\) and let \(\lesssim \in \!\{<,\leqslant \}\) and \(\gtrsim \in \!\{>,\geqslant \}\). Let further \(w\!\in \!\mathsf {W}\), \(\mathbf {x}\!\in \!\{1,2\}\), \(\phi \!\in \!\mathsf {bi}\mathcal {L}^\lnot _{\Box ,\lozenge }\), and \(c\!\in \!\{0,1\}\). A structure is either \(w\!:\!\mathbf {x}\!:\!\phi \) or c. We denote the set of structures with \(\mathsf {Str}\).
We define a constraint tableau as a downward branching tree whose branches are sets containing the following types of entries:

relational constraints of the form \(w\mathsf {R}w'\) with \(w,w'\in \mathsf {W}\);

structural constraints of the form \(\mathfrak {X}\lesssim \mathfrak {X}'\) with \(\mathfrak {X},\mathfrak {X}'\in \mathsf {Str}\).
Each branch can be extended by an application of a rule^{Footnote 6} from Fig. 4 or Fig. 5.
A tableau’s branch \(\mathcal {B}\) is closed iff one of the following conditions applies:

the transitive closure of \(\mathcal {B}\) under \(\lesssim \) contains \(\mathfrak {X}<\mathfrak {X}\);

\({0}\geqslant {1}\in \mathcal {B}\), or \(\mathfrak {X}>{1}\in \mathcal {B}\), or \(\mathfrak {X}<{0}\in \mathcal {B}\).
A tableau is closed iff all its branches are closed. We say that there is a tableau proof of \(\phi \) iff there is a closed tableau starting from the constraint \(w\!:\!1\!:\!\phi <1\).
An open branch \(\mathcal {B}\) is complete iff the following condition is met.

* If all premises of a rule occur on \(\mathcal {B}\), then its one conclusion^{Footnote 7} occurs on \(\mathcal {B}\).
Remark 4
Note that due to Proposition 1, we need to check only one valuation of \(\phi \) to verify its validity.
Convention 4
(Interpretation of constraints). The following table gives the interpretations of structural constraints on the example of \(\leqslant \).
entry  interpretation 
\(w\!:1\!:\!\phi \leqslant w'\!:2\!:\!\phi '\)  \(v_1(\phi ,w)\le v_2(\phi ',w')\) 
\(w\!:\!2\!:\!\phi \leqslant c\)  \(v_2(\phi ,w)\le c\) with \(c\in \{0,1\}\) 
As one can see from Fig. 4 and Fig. 5, the rules follow the semantical conditions from Definition 4. Let us discuss \(\rightarrow _1\!\leqslant \) and \(\Box _1\!\lesssim \) in more details.
The premise of \(\rightarrow _1\!\leqslant \) is interpreted as \(v_1(\phi \rightarrow \phi ',w)\leqslant x\). To decompose the implication, we check two options: either \(x=1\) (then, the value of \(\phi \rightarrow \phi '\) is arbitrary) or \(x<1\). In the second case, we use the semantics to obtain that \(v_1(\phi ',w)\leqslant x\) and \(v_1(\phi ,w)>v_1(\phi ',w)\).
In order to apply \(\Box _1\!\lesssim \) to \(w\!:\!1\!:\!\Box \phi \lesssim \mathfrak {X}\), we introduce a new state \(w''\) that is seen by w. Since we work in a finite branching model, \(w''\) can witness the value of \(\Box \phi \). Thus, we add \(w''\!:\!1\!:\!\phi \lesssim \mathfrak {X}\).
We also provide an example of how our tableaux work. On Fig. 6, one can see a successful proof on the left and a failed proof on the right.
Definition 7
(Branch realisation). We say that a model \(\mathfrak {M}=\langle W,R,v_1,v_2\rangle \) with \(W=\{w:w\text { occurs on }\mathcal {B}\}\) and \(R=\{\langle w,w'\rangle :w\mathsf {R}w'\in \mathcal {B}\}\) realises a branch \(\mathcal {B}\) of a tree iff the following conditions are met.

\(v_\mathbf {x}(\phi ,w)\le v_{\mathbf {x}'}(\phi ',w')\) for any \(w:\mathbf {x}:\phi \leqslant w':\mathbf {x}':\phi '\in \mathcal {B}\) with \(\mathbf {x},\mathbf {x}'\in \{1,2\}\).

\(v_\mathbf {x}(\phi ,w)\le c\) for any \(w:\mathbf {x}:\phi \leqslant {c}\in \mathcal {B}\) with \({c}\in \{0,1\}\).
Theorem 3
(Completeness). \(\phi \) is \(\mathbf {K}\mathsf {G}^2_{\mathsf {fb}}\) valid iff it has a \(\mathcal {T}(\mathbf {K}\mathsf {G}^2_{\mathsf {fb}})\) proof.
Proof
We consider only the \(\mathbf {K}\mathsf {G}^2_{\mathsf {fb}}\) case since \(\mathbf {K}\mathsf {biG}_{\mathsf {fb}}\) can be handled the same way. For soundness, we check that if the premise of the rule is realised, then so is at least one of its conclusions. We consider the cases of \(\rightarrow _1\!\leqslant \) and \(\Box _1\!\lesssim \). Assume that \(w\!:\!1\!:\phi \rightarrow \phi '\!\leqslant \!\mathfrak {X}\) is realised and assume w.l.o.g. that \(\mathfrak {X}=u\!:\!2\!:\!\psi \). It is clear that either \(v_2(\psi ,u)=1\) or \(v_2(\psi ,u)<1\). In the first case, \(\mathfrak {X}\geqslant 1\) is realised. In the second case, we have that \(v_1(\phi ,w)>v_1(\phi ',w)\) and \(v_1(\phi ',w)\leqslant v_2(\psi ,u)\). Thus, \(\mathfrak {X}<1\), \(w\!:\!1\!:\!\phi >w\!:\!1\!:\!\phi '\), and \(w\!:\!1\!:\!\phi '\leqslant u\!:\!1\!:\!\psi \) are realised as well, as required.
For \(\Box _1\!\lesssim \), assume that \(w\!:\!1\!:\Box \phi \!\leqslant \!\mathfrak {X}\) is realised and assume w.l.o.g. that \(\mathfrak {X}=u\!:\!2\!:\!\psi \). Thus, \(v_1(\Box \phi ,w)\leqslant v_2(\psi ,u)\) Then, since the model is finitely branching, there is an accessible state \(w''\) s.t. \(v_1(\phi ,w)\leqslant v_2(\psi ,u)\). Thus, \(w''\!:\!1\!:\phi \!\leqslant \!\mathfrak {X}\) is realised too.
As no closed branch is realisable, the result follows.
For completeness, we show that every complete open branch \(\mathcal {B}\) is realisable. We construct the model as follows. We let \(W=\{w:w\text { occurs in }\mathcal {B}\}\), and set \(R=\{\langle w,w'\rangle :w\mathsf {R}w'\in \mathcal {B}\}\). Now, it remains to construct the suitable valuations.
For \(i\in \{1,2\}\), if \(w\!:\!i\!:\!p\geqslant 1\in \mathcal {B}\), we set \(v_i(p,w)=1\). If \(w\!:\!i\!:\!p\leqslant 0\in \mathcal {B}\), we set \(v_i(p,w)=0\). To set the values of the remaining variables \(q_1\), ..., \(q_n\), we proceed as follows. Denote \(\mathcal {B}^+\) the transitive closure of \(\mathcal {B}\) under \(\lesssim \) and let
It is clear that there are at most \(2\cdot n\cdot W\) \([w\!:\!\mathbf {x}\!:\!q_i]\)’s since the only possible loop in \(\mathcal {B}^+\) is \(w_{i_1}\!:\!\mathbf {x}\!:\!r\leqslant \ldots \leqslant w_{i_1}\!:\!\mathbf {x}\!:\!r\), but in such a loop all elements belong to \([w_{i_1}\!:\!\mathbf {x}\!:\!r]\). We put \([w\!:\!\mathbf {x}\!:\!q_i]\prec [w'\!:\!\mathbf {x}'\!:\!q_j]\) iff there are \(w_k\!:\!\mathbf {x}\!:\!r\in [w\!:\!\mathbf {x}\!:\!q_i]\) and \(w'_k\!:\!\mathbf {x}'\!:\!r'\in [w'\!:\!\mathbf {x}'\!:\!q_j]\) s.t. \(w_k\!:\!\mathbf {x}\!:\!r<w'_k\!:\!\mathbf {x}'\!:\!r'\in \mathcal {B}^+\).
We now set the valuation of these variables as follows
Note that if some \(\phi \) contains s but \(\mathcal {B}^+\) contains no inequality with it, the above definition ensures that s is going to be evaluated at 0. Thus, all constraints containing only variables are satisfied.
It remains to show that all other constraints are satisfied. For that, we prove that if at least one conclusion of the rule is satisfied, then so is the premise. The propositional cases are straightforward and can be tackled in the same manner as in [5, Theorem 2]. We consider only the case of \(\lozenge _2\!\gtrsim \). Assume w.l.o.g. that \(\gtrsim =\geqslant \) and \(\mathfrak {X}=u\!:\!1\!:\!\psi \). Since \(\mathcal {B}\) is complete, if \(w\!:2\!:\!\lozenge \phi \geqslant u\!:\!1\!:\!\psi \in \mathcal {B}\), then for any \(w'\) s.t. \(w\mathsf {R}w'\in \mathcal {B}\), we have \(w'\!:2\!:\!\phi \geqslant u\!:\!1\!:\!\psi \in \mathcal {B}\), and all of them are realised by \(\mathfrak {M}\). But then \(w\!:2\!:\!\lozenge \phi \geqslant u\!:\!1\!:\!\psi \) is realised too, as required.
Theorem 4

1.
Let \(\phi \in \mathsf {bi}\mathcal {L}^\lnot _{\Box ,\lozenge }\) be not \(\mathbf {K}\mathsf {G}^2_{\mathsf {fb}}\) valid, and let \(\phi \) denote the number of symbols in it. Then there is a model \(\mathfrak {M}\) of the size \(O(\phi ^{\phi })\) and depth \(O(\phi )\) and \(w\in \mathfrak {M}\) s.t. \(v_1(\phi ,w)\ne 1\).

2.
\(\mathbf {K}\mathsf {G}^2_{\mathsf {fb}}\) validity and satisfiability^{Footnote 8} are \(\mathsf {PSPACE}\)complete.
Proof
We begin with 1. By Theorem 3, if \(\phi \) is not \(\mathbf {K}\mathsf {G}^2_{\mathsf {fb}}\) valid, we can build a falsifying model using tableaux. It is also clear from the rules on Fig. 5 that the depth of the constructed model is bounded from above by the maximal number of nested modalities in \(\phi \). The width of the model is bounded by the maximal number of modalities on the same level of nesting. The sharpness of the bound is obtained using the embedding of \(\mathbf {K}\) into \(\mathbf {K}\mathsf {G}^2_{\mathsf {fb}}\) since \(\mathbf {K}\) is complete w.r.t. finitely branching models and it is possible to force shallow trees of exponential size in \(\mathbf {K}\) (cf., e.g. [7, §6.7]). The embedding also entails \(\mathsf {PSPACE}\)hardness. It remains to tackle membership.
First, observe from the proof of Theorem 3 that \(\phi (p_1,\ldots ,p_n)\) is satisfiable (falsifiable) on \(\mathfrak {M}=\langle W,R,v_1,v_2\rangle \) iff there are \(v_1\) and \(v_2\) that give variables values from \(\mathsf {V}=\left\{ 0,\frac{1}{2\cdot n\cdot W},\ldots ,\frac{2\cdot n\cdot W1}{2\cdot n\cdot W},1\right\} \) under which \(\phi \) is satisfied (falsified).
As we mentioned, W is bounded from above by \(k^{k+1}\) with k being the number of modalities in \(\phi \). Therefore, we replace structural constraints with labelled formulas of the form \(w\!:\!i\!:\!\phi \!=\!\mathsf {v}\) (\(\mathsf {v}\in \mathsf {V}\)) avoiding comparisons of values of formulas in different states. As expected, we close the branch if it contains \(w\!:\!i\!:\!\psi \!=\!\mathsf {v}\) and \(w\!:\!i\!:\!\psi \!=\!\mathsf {v}'\) for \(\mathsf {v}\ne \mathsf {v}'\).
Now we replace the rules with the new ones that work with labelled formulas instead of structural constraints. Below, we give as an example new rules for \(\rightarrow \) and \(\lozenge \)^{Footnote 9} (with \(\mathsf {V}=m+1\)):
We now show how to build a satisfying model for \(\phi \) using polynomial space. We begin with \(w_0\!:\!1\!:\phi \!=\!1\) and start applying propositional rules (first, those that do not require branching). If we implement a branching rule, we pick one branch and work only with it: either until the branch is closed, in which case we pick another one; until no more rules are applicable (then, the model is constructed); or until we need to apply a modal rule to proceed. At this stage, we need to store only the subformulas of \(\phi \) with labels denoting their value at \(w_0\).
Now we guess a modal formula (say, \(w_0\!:\!2\!:\!\Box \chi \!=\!\frac{1}{m+1}\)) whose decomposition requires an introduction of a new state (\(w_1\)) and apply this rule. Then we apply all modal rules that use \(w_0\mathsf {R}w_1\) as a premise (again, if those require branching, we guess only one branch) and start from the beginning with the propositional rules. If we reach a contradiction, the branch is closed. Again, the only new entries to store are subformulas of \(\phi \) (now, with fewer modalities), their values at \(w_1\), and a relational term \(w_0\mathsf {R}w_1\). Since the depth of the model is \(O(\phi )\) and since we work with modal formulas one by one, we need to store subformulas of \(\phi \) with their values \(O(\phi )\) times, so, we need only \(O(\phi ^2)\) space.
Finally, if no rule is applicable and there is no contradiction, we mark \(w_0\!:\!2\!:\!\Box \chi \!=\!\frac{1}{m+1}\) as ‘safe’. Now we delete all entries of the tableau below it and pick another unmarked modal formula that requires an introduction of a new state. Dealing with these one by one allows us to construct the model branch by branch. But since the length of each branch of the model is bounded by \(O(\phi )\) and since we delete branches of the model once they are shown to contain no contradictions, we need only polynomial space.
We end the section with two simple observations. First, Theorems 3 and 4 are applicable both to \(\mathbf {K}\mathsf {biG}_{\mathsf {fb}}\) and \(\mathbf {K}\mathsf {G}^2_{\mathsf {fb}}\) because the latter is conservative over the former. Secondly, since \(\mathbf {K}\mathsf {G}^2\) and \(\mathbf {K}\mathsf {biG}\) are conservative over \(\mathfrak {GK}^c\) and since \(\mathbf {K}\) can be embedded in \(\mathfrak {GK}^c\), the lower bounds on complexity of a classical modal logic of some class of frames \(\mathbb {K}\) and \(\mathsf {G}^2\) modal logic of \(\mathbb {K}\) will coincide.
5 Concluding Remarks
In this paper, we developed a crisp modal expansion of the twodimensional Gödel logic \(\mathsf {G}^2\) as well as an expansion of biGödel logic with \(\Box \) and \(\lozenge \) both for crisp and fuzzy frames. We also established their connections with modal Gödel logics, and gave a complexity analysis of their finitely branching fragments.
The following steps are: to study the proof theory of \(\mathbf {K}\mathsf {G}^2\) and \(\mathbf {K}\mathsf {G}^2_{\mathsf {fb}}\): both in the form of Hilbertstyle and sequent calculi; establish the decidability (or lack thereof) for the case of \(\mathbf {K}\mathsf {G}^2\). Moreover, twodimensional treatment of information invites for different modalities, e.g. those formalising aggregation strategies given in [6]—in particular, the cautious one (where the agent takes minima/infima of both positive and negative supports of a given statement) and the confident one (whereby the maxima/suprema are taken). Last but not least, while in this paper we assumed that our access to sources is crisp, one can argue that the degree of our bias towards the given source can be formalised via fuzzy frames. Thus, it would be instructive to construct a fuzzy version of \(\mathbf {K}\mathsf {G}^2\).
In a broader perspective, we plan to provide a general treatment of twodimensional modal logics of uncertainty. Indeed, within our project [5, 6], we are formalising reasoning with heterogeneous and possibly incomplete and inconsistent information (such as crisp or fuzzy data, personal beliefs, etc.) in a modular fashion. This modularity is required because different contexts should be treated with different logics—indeed, not only the information itself can be of various nature but the reasoning strategies of different agents even applied to the same data are not necessarily the same either. Thus, since we wish to account for this diversity, we should be able to combine different logics in our approach.
Notes
 1.
 2.
Note that \(\Box \) and \(\lozenge \) are not interdefinable in \(\mathfrak {GK}\)—cf. [36, Lemma 6.1] for details.
 3.
There is, however, a semantics in [11] w.r.t. which bimodal \(\mathfrak {GK}\) has FMP.
 4.
To the best of our knowledge, the only work on biGödel (symmetric Gödel) modal logic is [20]. There, the authors propose an expansion of \(\mathsf {biG}\) with \(\Box \) and \(\lozenge \) equipped with prooftheoretic interpretation and provide its algebraic semantics.
 5.
Bimodal \(\mathbf {K}\mathsf {biG}^\mathsf {f}\) lacks have FMP since it is a conservative extension of \(\mathfrak {GK}\).
 6.
If \(\mathfrak {X}<1\) and \(\mathfrak {X}<\mathfrak {X}'\) (or \(0<\mathfrak {X}'\) and \(\mathfrak {X}<\mathfrak {X}'\)) occur on \(\mathcal {B}\), then the rules are applied only to \(\mathfrak {X}<\mathfrak {X}'\).
 7.
Note that branching rules have two conclusions.
 8.
Satisfiability and falsifiability (nonvalidity) are reducible to each other using : \(\phi \) is satisfiable iff is falsifiable; \(\phi \) is falsifiable iff is satisfiable.
 9.
Intuitively, for a value \(1>\mathsf {v}>0\) of \(\lozenge \phi \) at w, we add a new state that witnesses \(\mathsf {v}\), and for a state on the branch, we guess a value smaller than \(\mathsf {v}\). Other modal rules can be rewritten similarly.
References
Agostino, M.D.: Investigations into the complexity of some propositional calculi. Oxford University Computing Laboratory, Oxford (1990)
Avron, A., Konikowska, B.: Decomposition proof systems for GödelDummett logics. Stud. Logica 69(2), 197–219 (2001)
Baaz, M.: Infinitevalued Gödel logics with \(0 \)\(1 \)projections and relativizations. In: Gödel 1996: Logical Foundations of Mathematics, Computer Science and Physics–Kurt Gödel’s legacy, Brno, Czech Republic, August 1996, Proceedings, pp. 23–33. Association for Symbolic Logic (1996)
Belnap, Nuel D..: How a computer should think. In: Omori, H., Wansing, H. (eds.) New Essays on BelnapDunn Logic. SL, vol. 418, pp. 35–53. Springer, Cham (2019). https://doi.org/10.1007/9783030311360_4
Bílková, M., Frittella, S., Kozhemiachenko, D.: Constraint tableaux for twodimensional fuzzy logics. In: Das, A., Negri, S. (eds.) TABLEAUX 2021. LNCS (LNAI), vol. 12842, pp. 20–37. Springer, Cham (2021). https://doi.org/10.1007/9783030860592_2
Bílková, M., Frittella, S., Majer, O., Nazari, S.: Belief based on inconsistent information. In: Martins, M.A., Sedlár, I. (eds.) Dynamic Logic. New Trends and Applications, pp. 68–86. Springer, Cham (2020). https://doi.org/10.1007/9783030658403_5
Blackburn, P., Rijke, M.D., Venema, Y.: Modal logic. Cambridge Tracts in Theoretical Computer Science, vol. 53. Cambridge University Press, 4. print. with corr. edn. (2010)
Bobillo, F., Delgado, M., GómezRomero, J., Straccia, U.: Fuzzy description logics under Gödel semantics. Int. J. Approx. Reason. 50(3), 494–514 (2009)
Bobillo, F., Delgado, M., GómezRomero, J., Straccia, U.: Joining Gödel and Zadeh fuzzy logics in fuzzy description logics. Int. J. Uncertain. Fuzziness KnowledgeBased Syst. 20(04), 475–508 (2012)
Borgwardt, S., Distel, F., Peñaloza, R.: Decidable Gödel description logics without the finitelyvalued model property. In: Fourteenth International Conference on the Principles of Knowledge Representation and Reasoning (2014)
Caicedo, X., Metcalfe, G., Rodríguez, R., Rogger, J.: A finite model property for Gödel modal logics. In: Libkin, L., Kohlenbach, U., de Queiroz, R. (eds.) WoLLIC 2013. LNCS, vol. 8071, pp. 226–237. Springer, Heidelberg (2013). https://doi.org/10.1007/9783642399923_20
Caicedo, X., Rodriguez, R.: Standard Gödel modal logics. Stud. Logica 94(2), 189–214 (2010). https://doi.org/10.1007/s1122501092301
Caicedo, X., Rodríguez, R.: Bimodal Gödel logic over [0,1]valued Kripke frames. J. Log. Comput. 25(1), 37–55 (2015)
Chagrov, A., Zakharyaschev, M.: Modal Logic. Clarendon Press, Oxford (1997)
Cintula, P., Noguera, C.: Modal logics of uncertainty with twolayer syntax: a general completeness theorem. In: Kohlenbach, U., Barceló, P., de Queiroz, R. (eds.) WoLLIC 2014. LNCS, vol. 8652, pp. 124–136. Springer, Heidelberg (2014). https://doi.org/10.1007/9783662441459_9
Dunn, J.M.: Intuitive semantics for firstdegree entailments and ‘coupled trees’. Philos. Stud. 29(3), 149–168 (1976)
Ertola, R., Esteva, F., Flaminio, T., Godo, L., Noguera, C.: Paraconsistency properties in degreepreserving fuzzy logics. Soft Comput. 19, 1–16 (2014). https://doi.org/10.1007/s0050001414890
Fagin, R., Halpern, J.Y., Moses, Y., Vardi, M.Y.: Reasoning About Knowledge. MIT Press, Cambridge (2003)
Ginsberg, M.: Multivalued logics: a uniform approach to reasoning in AI. Comput. Intell 4, 256–316 (1988)
Grigolia, R., Kiseliova, T., Odisharia, V.: Free and projective bimodal symmetric gödel algebras. Stud. Logica 104(1), 115–143 (2016)
Hähnle, R.: A new translation from deduction into integer programming. In: Calmet, J., Campbell, J.A. (eds.) AISMC 1992. LNCS, vol. 737, pp. 262–275. Springer, Heidelberg (1993). https://doi.org/10.1007/3540573224_18
Hähnle, R.: Manyvalued logic and mixed integer programming. Ann. Math. Artif. Intell. 12(3–4), 231–263 (1994)
Hájek, P.: Metamathematics of Fuzzy Logic. Trends in Logic, 4th edn. Springer, Dordrecht (1998). https://doi.org/10.1007/9789401153003
Jansana, R., Rivieccio, U.: Residuated bilattices. Soft. Comput. 16(3), 493–504 (2012)
Kułacka, A., Pattinson, D., Schröder, L.: Syntactic labelled tableaux for Łukasiewicz fuzzy ALC. In: TwentyThird International Joint Conference on Artificial Intelligence. AAAI Press (2013)
Lascio, L.D., Gisolfi, A.: Graded tableaux for rational Pavelka logic. Int. J. Intell. Syst. 20(12), 1273–1285 (2005)
Leitgeb, H.: Hype: a system of hyperintensional logic (with an application to semantic paradoxes). J. Philos. Log. 48(2), 305–405 (2019)
Metcalfe, G., Olivetti, N.: Proof systems for a Gödel modal logic. In: Giese, M., Waaler, A. (eds.) TABLEAUX 2009. LNCS (LNAI), vol. 5607, pp. 265–279. Springer, Heidelberg (2009). https://doi.org/10.1007/9783642027161_20
Metcalfe, G., Olivetti, N.: Towards a proof theory of Gödel modal logics. Log. Methods Comput. Sci. 7 (2011)
Metcalfe, G., Olivetti, N., Gabbay, D.: Proof Theory for Fuzzy Logics. Applied Logic Series, vol. 36. Springer, Dordrecht (2008). https://doi.org/10.1007/9781402094095
Moisil, G.: Logique modale. Disquisitiones mathematicae et physicae 2, 3–98 (1942)
Negri, S.: Proof analysis in modal logic. J. Philos. Log. 34(5–6), 507–544 (2005)
Odintsov, S., Wansing, H.: Routley star and hyperintensionality. J. Philos. Log. 50, 33–56 (2021)
Omori, H., Wansing, H.: 40 years of FDE: an introductory overview. Stud. Logica. 105(6), 1021–1049 (2017). https://doi.org/10.1007/s1122501797486
Rivieccio, U.: An algebraic study of bilatticebased logics. Ph.D. thesis, University of Barcelona – University of Genoa (2010)
Rodriguez, R.O., Vidal, A.: Axiomatization of Crisp Gödel Modal Logic. Stud. Logica 109(2), 367–395 (2020). https://doi.org/10.1007/s11225020099105
Vakarelov, D.: Notes on Nlattices and constructive logic with strong negation. Stud. Logica 36(1–2), 109–125 (1977)
Wansing, H.: Constructive negation, implication, and coimplication. J. Appl. NonClassical Logics 18(2–3), 341–364 (2008). https://doi.org/10.3166/jancl.18.341364
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Open Access This chapter is licensed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license and indicate if changes were made.
The images or other third party material in this chapter are included in the chapter's Creative Commons license, unless indicated otherwise in a credit line to the material. If material is not included in the chapter's Creative Commons license and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder.
Copyright information
© 2022 The Author(s)
About this paper
Cite this paper
Bílková, M., Frittella, S., Kozhemiachenko, D. (2022). Paraconsistent Gödel Modal Logic. In: Blanchette, J., Kovács, L., Pattinson, D. (eds) Automated Reasoning. IJCAR 2022. Lecture Notes in Computer Science(), vol 13385. Springer, Cham. https://doi.org/10.1007/9783031107696_26
Download citation
DOI: https://doi.org/10.1007/9783031107696_26
Published:
Publisher Name: Springer, Cham
Print ISBN: 9783031107689
Online ISBN: 9783031107696
eBook Packages: Computer ScienceComputer Science (R0)