--- title: Bimodal Logic of Weak Density url: https://www.emergentmind.com/topics/bimodal-logic-of-weak-density type: topic --- # Bimodal Logic of Weak Density Bimodal logic of weak density is a bimodal normal modal logic whose characteristic interaction law says that every \(a\)-edge can be factorized into an \(a\)-edge followed by a \(b\)-edge. In its standard two-modality presentation, the underlying frames are triples \((W,R_a,R_b)\) satisfying \[ \forall s,t\in W\;\bigl(sR_a t \rightarrow \exists u\in W\,(sR_a u \wedge uR_b t)\bigr), \] equivalently \(R_a \subseteq R_a\circ R_b\). The logic is axiomatized by \(\Diamond_a p \rightarrow \Diamond_a\Diamond_b p\), or dually by \(\square_a\square_b p \rightarrow \square_a p\), and recent work places it among grammar-like bimodal interactions with exact PSPACE complexity results for satisfiability and validity [2507.11238][2507.14949]. ## 1. Formal setting and semantic interpretation The language is a bimodal propositional language with two independent box modalities, written \(\square_a\) and \(\square_b\), and generated by \[ \phi := p \mid \bot \mid \neg \phi \mid (\phi \wedge \phi)\mid \square_a \phi \mid \square_b \phi. \] As usual, \[ \top,\ \vee,\ \rightarrow,\ \lozenge_a \phi := \neg \square_a \neg \phi,\ \lozenge_b \phi := \neg \square_b \neg \phi. \] Semantically, formulas are interpreted on Kripke models \[ M=(W,R_a,R_b,V), \] where \(W\neq\emptyset\), \(R_a,R_b\subseteq W\times W\), and \(V\) is a valuation. The modal clauses are standard: \[ M,s\models \square_a\phi \iff \forall t\in W\ (sR_a t \Rightarrow M,t\models \phi), \] \[ M,s\models \square_b\phi \iff \forall t\in W\ (sR_b t \Rightarrow M,t\models \phi). \] Equivalently, \[ M,s\models \lozenge_a\phi \iff \exists t\in W\ (sR_a t \land M,t\models\phi), \qquad M,s\models \lozenge_b\phi \iff \exists t\in W\ (sR_b t \land M,t\models\phi). \] This is a two-modality normal modal language, with one modality \(a\) and one modality \(b\) [2507.11238]. The crucial semantic condition is weak density: \[ \forall s,t\in W\;\bigl(sR_a t \rightarrow \exists u\in W\,(sR_a u \wedge uR_b t)\bigr). \] The interaction between the two modalities is not arbitrary: every \(a\)-edge can be factorized into an \(a\)-edge followed by a \(b\)-edge. Intuitively, \(R_b\) provides a kind of local refinement or densification of \(R_a\): whenever one can go from \(s\) to \(t\) via \(R_a\), there is an intermediate world \(u\) still \(a\)-accessible from \(s\), and from which \(t\) is \(b\)-accessible [2507.14949]. A common confusion is to identify weak density with ordinary density of a single relation. The unimodal density condition is \[ \forall s,t\,(sRt \rightarrow \exists u\,(sRu\wedge uRt)), \] equivalently \(R\subseteq R\circ R\). By contrast, bimodal weak density is not ordinary density of either \(R_a\) or \(R_b\); it is an interaction condition between the two modalities, namely \[ R_a \subseteq R_a\circ R_b \] [2507.11238]. ## 2. Axiomatics and frame correspondence The bimodal logic of weak density is denoted by the least bimodal normal logic containing \[ \square_a \square_b p \rightarrow \square_a p. \] The same principle appears in diamond form as \[ \Diamond_a p \rightarrow \Diamond_a \Diamond_b p. \] These are duals of one another and express the same frame condition [2507.11238]. The first-order correspondent is exactly \[ \forall x\,\forall y\,(R_a(x,y)\rightarrow \exists z\,(R_a(x,z)\wedge R_b(z,y))), \] equivalently \[ R_a \subseteq R_a\circ R_b. \] The modal reading is direct: whenever there is an \(a\)-successor satisfying \(p\), there is an \(a\)-successor from which a \(b\)-step reaches a \(p\)-world; dually, if all \(a\)-successors see only \(b\)-successors satisfying \(p\), then already all \(a\)-successors satisfy \(p\) [2507.11238]. In the transitive extensions, the base bimodal system is the fusion of two copies of \(K\), and the further axioms are: \[ 4(a)\ :=\ \lozenge_a\lozenge_a p \to \lozenge_a p, \qquad 4(b)\ :=\ \lozenge_b\lozenge_b p \to \lozenge_b p, \qquad De_{a,b}\ :=\ \lozenge_a p \to \lozenge_a\lozenge_b p. \] The corresponding frame conditions are transitivity of \(R_a\), transitivity of \(R_b\), and weak density. The semantic correspondence is stated explicitly: if \(De_{a,b}\in L\), then the frame is weakly dense; if \(4(a)\in L\), then \(R_a\) is transitive; if \(4(b)\in L\), then \(R_b\) is transitive [2507.14949]. From the standpoint of grammar logics, the axiom has the form \[ \Diamond_{a_1}\cdots \Diamond_{a_m} p \rightarrow \Diamond_{b_1}\cdots \Diamond_{b_n} p, \] and weak density is the instance \[ \Diamond_a p \rightarrow \Diamond_a\Diamond_b p. \] This places the logic in a fragment where special interaction patterns remain decidable, even when more general grammar logics become undecidable [2507.14949]. ## 3. Decision problems and complexity The standard decision problem is the validity problem over the class of all weakly dense frames. In one formulation, \[ DP_{a,b}: \] - input: a formula \(\phi\); - output: decide whether \(\phi\) is valid in the class of all weakly dense frames. Since validity is the complement of satisfiability of the negation, the algorithmic content is really about local satisfiability of formulas or finite sets of formulas. The exact theorem is: \[ DP_{a,b}\text{ is PSPACE-complete.} \] The same complexity statement is also given for the plain weak-density logic \(K+De_{a,b}\): both satisfiability and validity are PSPACE-complete [2507.11238][2507.14949]. The hardness argument is straightforward. The bimodal logic is a conservative extension of ordinary modal logic \(K\), hence PSPACE-hard. For the upper bound, the relevant papers provide tableau-like or recursive procedures using finite local structures, so satisfiability lies in \(NPSPACE\), hence in PSPACE by Savitch’s theorem; validity therefore lies in coPSPACE \(=\) PSPACE [2507.11238][2507.14949]. The main complexity results can be summarized as follows. | Logic | Characteristic condition | Complexity | |---|---|---| | \(K+De_{a,b}\) | \(R_a \subseteq R_a\circ R_b\) | PSPACE-complete | | \(K+4(a)+De_{a,b}\), \(K+4(b)+De_{a,b}\), \(K+4(a)+4(b)+De_{a,b}\) | weak density with transitivity of \(R_a\), \(R_b\), or both | PSPACE-complete | | \(K_\Pi\) | \(\Pi\)-dense frames | PSPACE-complete | A useful comparative point is the contrast with unimodal density. One extended study proves that the satisfiability problem of the unimodal logic of density is in \(EXPTIME\), while the satisfiability problem of the bimodal logic of weak density is in \(PSPACE\). The same source explicitly notes that the exact complexity of unimodal density remains open, whereas the bimodal weak-density case is exactly PSPACE-complete [2507.11238]. ## 4. Tableau methods, consistent classical saturations, and windows The central decision procedures do not use a plain tree tableau. They work with finite saturated sets of formulas and with finite local patterns called windows. A technical basis is the use of consistent classical saturations. Given a finite set \(u\) of formulas, a CCS of \(u\) is a finite set \(w\) such that \(u\subseteq w\subseteq cl(u)\) and \(w\) is propositionally saturated and open; equivalently, in the extended presentation, a CCS is a propositionally saturated open branch extending \(u\). These objects are finite and polynomially bounded in size [2507.14949][2507.11238]. The distinctive contribution of the weak-density work is the introduction of windows, which are finite local patterns that represent the \(a\)-then-\(b\)-chain forced by weak density. In one formulation, if \(w\) is a CCS and \(k\ge d(w)\), then a \(k\)-window for \(w\) is a sequence \[ (w_i)_{0\le i\le k} \] such that \[ w_k \in CCS(\Box_a^{-}(w)), \] and for all \(0\le i