You are currently viewing a new version of our website. To view the old version click .
Logics
  • Article
  • Open Access

5 September 2025

Bisimulation Quotient in Inquisitive Modal Logic

Department of Mathematics, Faculty of Science, University of Split, 21000 Split, Croatia
This article belongs to the Special Issue Logic, Language, and Information

Abstract

Inquisitive modal logic InqML is a natural generalization of basic modal logic, with ⊞ as a primitive modal operator. In this paper, we study the bisimulation quotients in the logic InqML . For a given inquisitive modal model M = ( W , Σ , V ) , we first show that the bisimilarity relation is an equivalence relation on W and that there is the largest bisimulation on M . We then define the bisimulation quotient and prove that a model is connected to its bisimulation quotient by a surjective bounded morphism. Finally, we prove that two models are globally bisimilar if and only if their bisimulation quotients are isomorphic.

1. Introduction

Inquisitive logic is a generalization of classical logic that can express both statements and questions. The language of inquisitive logic is obtained by extending the language of classical logic with a connective \ , which is called the inquisitive disjunction. With the connective \ , it is possible to form formulas that represent questions. For example, the formula φ   \ ψ can be read as “is φ or ψ the case?”. Although it is not clear what it means for a question to be true or false, it is possible to say whether the question is settled by the given information or not. The semantics of inquisitive logic is thus defined by a relationship between information states and formulas, where the information states are modeled as sets of worlds1.
The inquisitive modal logic InqML is a generalization of the basic modal logic with a new modal operator ⊞, called window. The logic InqML was first introduced in [1] in an epistemic context. In [1], it is shown that, in this logic, it is possible to express not only the information that agents have but also the information that they are interested in. For example, the formula ? φ can be read as “the agent wonders whether φ ”, where ? φ is an abbreviation for φ   \ ¬ φ .
The inquisitive modal logic InqML was systematically elaborated in [2], while in [3,4,5], various results in the model theory of InqML were presented. In particular, in [3] the notions of bisimulation and bisimulation games were defined, as was the standard translation from InqML to two-sorted first-order logic. Furthermore, analogues of the Ehrenfeucht–Fraïssé theorem and the van Benthem characterization theorem for InqML were proved. In [5], using so-called pseudo-models and an alternative definition of the standard translation, the compactness of InqML was proved in a purely model-theoretic way and a Hennessy–Milner class for InqML was defined. In [4], the finite model property of InqML was proved via filtrations, and as a consequence, the decidability of InqML was obtained.
This paper deals with the bisimulation quotients and thus makes a further contribution to the model theory of InqML . In basic modal logic, using the facts that the bisimilarity relation is an equivalence relation and that the largest bisimulation exists, one can define the bisimulation quotient of an observed Kripke model. Furthermore, it is proved that a Kripke model is connected to its bisimulation quotient by a surjective bounded morphism, as well as that two Kripke models are globally bisimilar if and only if their bisimulation quotients are isomorphic (cf. [6]).
In this paper, we generalize these results for the inquisitive modal logic InqML . We first show that for a given inquisitive modal model M = ( W , Σ , V ) , the bisimilarity relation is an equivalence relation on W and that M admits the largest bisimulation. Furthermore, we define the bisimulation quotient and show that a model is connected to its bisimulation quotient by a surjective bounded morphism that guarantees the modal equivalence between the model and its bisimulation quotient. Finally, we prove that two inquisitive modal models are globally bisimilar if and only if their bisimulation quotients are isomorphic.
In Section 2, we give an overview of basic definitions and results in InqML . In Section 3, we show that the bisimilarity relation is an equivalence relation and that there is the largest bisimulation between considered models. In Section 4, we define the bisimulation quotient and show that this structure is an inquisitive modal model. Furthermore, we prove that when switching from an inquisitive modal model to its bisimulation quotient, the satisfaction of the formulas is preserved. Finally, we prove the main result of this paper: models are globally bisimilar if and only if their bisimulation quotients are isomorphic.

2. Preliminaries

Definitions and claims from this section are taken from [2].
Let W be a non-empty set of elements called the worlds. An information state (or simply, state) over W is any subset s W . Furthermore, an inquisitive state over W is a non-empty set of information states Π P ( W ) that is downward closed, i.e., if s Π and t s , then t Π .
Definition 1.
Let P be a set of propositional variables. An inquisitive modal model is a triple M = ( W , Σ , V ) , where W is a set of worlds, Σ : W P ( P ( W ) ) is a function that to each world w assigns an inquisitive state Σ ( w ) , and V : P P ( W ) is a function that to each propositional variable assigns a set of worlds.
The language L of inquisitive modal logic InqML is given as follows:
φ : : = p ( φ φ ) ( φ φ ) ( φ   \ φ ) φ .
We take negation and disjunction as defined connectives in the usual way:
¬ φ : = φ , φ ψ : = ¬ ( ¬ φ ¬ ψ ) .
Furthermore, we use the following abbreviation: ? φ : = φ   \ ¬ φ .
Definition 2 (Semantics of InqML ).
Let M = ( W , Σ , V ) be an inquisitive modal model. The relation of support between states in M and formulas of L is defined as follows:
  • M , s p s V ( p ) ;
  • M , s s = ;
  • M , s φ ψ M , s φ and M , s ψ ;
  • M , s φ ψ for all t s , M , t φ implies M , t ψ ;
  • M , s φ   \ ψ M , s φ or M , s ψ ;
  • M , s φ for all w s , for all t Σ ( w ) , M , t φ .
A formula φ is true at a world w in an inquisitive modal model M , denoted M , w φ , if M , { w } φ .
The modality ⊞ can be seen as a natural counterpart to the standard modal operator □. To illustrate this, consider a Kripke model M = ( W , R , V ) for basic modal logic. The accessibility relation R can equivalently be viewed as a function σ : W P ( W ) that assigns to each world w the set of worlds accessible from w. Thus, we have M , w φ if and only if σ ( w ) | φ | , where | φ | W denotes the set of worlds where φ is true.
In inquisitive modal logic, the function σ is replaced by a function Σ : W P ( P ( W ) ) , which assigns to each world w a set of sets of worlds. If [ φ ] denotes the set of sets of worlds where φ is supported, then we have M , w φ if and only if Σ ( w ) [ φ ] . This shows that, from the perspective of mathematical logic, inquisitive modal logic is a natural generalization of basic modal logic.
For further comments on the modality □, including a discussion of the differences between □ and ⊞, see Remark 1.
Let M = ( W , Σ , V ) be an inquisitive modal model. A state s W is compatible with a formula φ if there is t s , t , such that M , t φ . Using this notion, the support conditions for the connectives ¬ and ∨ can be expressed as follows:
  • M , s ¬ φ s is not compatible with φ ;
  • M , s φ ψ for all t s , t , so we prove that t is compatible with φ or t is compatible with ψ .
Let us illustrate the difference between the connectives \ and ∨ with the below example.
Example 1.
Let M = ( W , Σ , V ) be an inquisitive modal model, with s W and p , q propositional variables. Then, for the formulas p   \ q and p q , the following holds:
  • M , s p   \ q M , s p or M , s q s V ( p ) or s V ( q ) for all w s , so we have w V ( p ) or for all w s , we have w V ( q ) for all w s , we have M , w p or for all w s , and we have M , w q ;
  • M , s p q for all t s , t , so we have t is compatible with p or t is compatible with q⇔ for all w s , we have { w } is compatible with p or { w } is compatible with q⇔ for all w s , and we have M , w p or M , w q .
It is easy to show that the following properties hold:
  • Persistence:  I f   M , s φ and   t s , then   M , t φ ;
  • Empty state property:  M , φ .
If the support condition of a formula is completely determined by its truth condition, we refer to such a formula as truth-conditional.
Definition 3.
A formula φ L is truth-conditional if, for all M , s , the following holds:
M , s φ if and only if for all w s we have M , w φ .
We regard truth-conditional formulas as statements, and non-truth-conditional formulas as questions.
Example 2.
Let M = ( W , Σ , V ) be an inquisitive modal model, where W = { w , u } , Σ ( w ) = Σ ( u ) = { } , and V ( p ) = { w } for the propositional variable p. Consider the formula ? p . Although M , w ? p and M , u ? p , we have M , { w , u } / ? p . Hence, the formula ? p is a question.
The set of declarative formulas is defined as follows:
α : : = p ( α α ) ( α α ) φ ,
where φ is an arbitrary formula.
The set of declarative formulas corresponds exactly to the set of truth-conditional formulas up to logical equivalence (cf. [2]).
Remark 1.
In some of the literature, the modal operator □ is included in the alphabet with the following semantics:
M , s φ for all w s we have M , Σ ( w ) φ .
However, it is shown that every formula of the form φ is equivalent to a disjunction of formulas of the form ψ ; thus, □ can be eliminated from the alphabet (see cf. [2] for more details).
Furthermore, both formulas φ and φ are statements, but using only the operator □, it is not possible to obtain a statement that is not equivalent to some formula of basic modal logic. For example, the formula ? p is equivalent to the formula p ¬ p . On the other hand, using the operator , it is possible to obtain a statement that has no counterpart in basic modal logic (e.g., ? p ). By embedding questions under the modality , we can therefore formulate new statements that cannot be expressed in basic modal logic (for more details, see cf. [2]).
In an epistemic context, the operator □ is used to express only the information that agents have. In contrast, the operator also allows us to express the information that agents are interested in, thus capturing not only what they know but also what they want to resolve (see cf. [1,2] for more details on inquisitive epistemic logic).
For more basic properties of InqML , see [2].

3. The Bisimilarity Relation

As previously mentioned, bisimulation in inquisitive modal logic InqML was first defined and studied in [3]. The goal of bisimulation is to establish a relation between two inquisitive modal models in which related worlds agree on the propositional variables and have corresponding inquisitive states.
Let M = ( W , R , V ) be a Kripke model for basic modal logic. In this model, there is only one type of transition: from a world to a world. Therefore, bisimulation in basic modal logic is defined as a binary relation on the set of worlds.
In an inquisitive modal model, the function Σ assigns to each world a set of states, which leads to two types of transitions: from a world to a state and from a state to a world. Namely, a world w can be associated with a state s Σ ( w ) , while a state s can be associated with a world u s . Therefore, the definition of bisimulation in InqML must be such that it takes both types of transitions into account.
Let M = ( W , Σ , V ) and M = ( W , Σ , V ) be inquisitive modal models. The conditions under which a relation Z can be considered a bisimulation are as follows: First, if w W and w W are worlds such that w Z w , then the same propositional variables must be true at both worlds. Second, if w Z w , then for each state s Σ ( w ) , there must exist a state s Σ ( w ) such that s Z s , and vice versa. Third, if s Z s , then for each w s , there must exist w s such that w Z w , and vice versa. A bisimulation Z should therefore be a relation Z W × W P ( W ) × P ( W ) that satisfies the above conditions (cf. [3]).
However, as shown in [3], the definition of bisimulation can also be formulated as a relation defined exclusively on the set of worlds of the observed models, i.e., as a relation Z W × W . In this paper, we will use this formulation. For this purpose, we first define the below relation.
The lifting of a relation Y W × W is the relation Y ¯ P ( W ) × P ( W ) defined with s Y ¯ s if and only if the following conditions are satisfied:
  • For all w s , there is w s such that w Y w ;
  • For all w s , there is w s such that w Y w .
The purpose of the relation Y ¯ is to define how subsets of two sets relate to each other based on a binary relation between their elements. Furthermore, the relation Y ¯ is clearly uniquely determined by Y.
Remark 2.
Notice that for a relation Y W × W , we have Y ¯ 1 = Y 1 ¯ . Furthermore, if Y 1 W × W and Y 2 W × W are relations, then Y 1 ¯ Y 2 ¯ = Y 1 Y 2 ¯ .
Now, we can define the notion of bisimulation in InqML (cf. [3]).
Definition 4.
Let M = ( W , Σ , V ) and M = ( W , Σ , V ) be inquisitive modal models. A non-empty relation Z W × W is called a bisimulation if the following conditions are satisfied:
(at) 
If w Z w , then w V ( p ) if and only if w V ( p ) , for all p P ;
(forth) 
If w Z w and s Σ ( w ) , then there is s Σ ( w ) such that s Z ¯ s ;
(back) 
If w Z w and s Σ ( w ) , then there is s Σ ( w ) such that s Z ¯ s .
We say that the worlds w and w are bisimilar, denoted by M , w M , w , if there exists a bisimulation Z such that w Z w .
We say that the states s and s are bisimilar, denoted by M , s M , s , if there exists a bisimulation Z such that s Z ¯ s .
The following remarks point out connections between the notion of bisimulation used here and related approaches used in the literature.
Remark 3.
The definition of bisimilarity between states in inquisitive modal logic is similar to that in modal team logic, where formulas are also evaluated over sets of worlds (cf. [7]). However, modal team logic uses Kripke models so every world is directly connected to other worlds, whereas in InqML , each world is connected to information states.
Therefore, the notions of bisimilarity between worlds and bisimilarity between states in InqML are closely related, unlike in modal team logic, where the latter is defined on the basis of the former.
Remark 4.
Inquisitive modal models can be seen as downward closed neighborhood models2, i.e., models where the set of neighborhoods is closed under subsets. In neighborhood semantics for modal logic (cf. [8]), a formula φ is true at a world w if the set of worlds where φ is true is one of the neighborhoods of w.
Although InqML and neighborhood semantics are based on similar models, they lead to different logics, since the neighborhood function is used differently to interpret formulas. Furthermore, as shown in [3], InqML and neighborhood semantics are incomparable in terms of expressive power, which results in different notions of bisimilarity (cf. [9]).
On the other hand, the definition of bisimilarity in InqML is quite similar to that in monotonic modal logic, where neighborhood models are closed under supersets, in contrast to the subset closure condition for inquisitive modal models (cf. [10]).
Let us now consider the connection between bisimilarity and modal equivalence.
Definition 5.
Let M = ( W , Σ , V ) and M = ( W , Σ , V ) be inquisitive modal models. The states s and s are modally equivalent, denoted by M , s M , s , if for every formula φ L the following holds:
M , s φ if and only if M , s φ .
As expected, it is shown in [3] that if the states are bisimilar, then they are modally equivalent. The converse, i.e., the claim that modal equivalence implies bisimilarity, does not hold. However, in [3], an Ehrenfeucht–Fraïssé theorem for InqML is proved, showing that, assuming a finite set of propositional variables, the finite levels n of bisimulation correspond to the levels of modal equivalence up to a modal depth of at most n.
Let M = ( W , Σ , V ) be an inquisitive modal model. Consider the bisimilarity relation between worlds in W, i.e., the relation defined as follows:
w u if and only if there is a bisimulation Z W × W such that w Z u .
The first goal is to prove that the bisimilarity relation ∼ is an equivalence relation, which leads to the below proposition.
Proposition 1.
Let M = ( W , Σ , V ) , M = ( W , Σ , V ) , and M = ( W , Σ , V ) be inquisitive modal models. Then, the following hold:
( a )
The relation Z = { ( w , w ) : w W } W × W is a bisimulation;
( b )
If Z W × W is a bisimulation, then Z 1 = { ( w , w ) : w Z w } W × W is a bisimulation;
( c )
If Z W × W and Z W × W are bisimulations, then Z = Z Z W × W is a bisimulation.
Proof. 
Claims ( a ) and ( b ) are straightforward, so we focus on proving claim ( c ) . We show that Z satisfies the conditions ( a t ) , ( f o r t h ) , and ( b a c k ) :
( a t )
Let w Z w . Then, there is w such that w Z w and w Z w . Since Z and Z are bisimulations, it follows that w V ( p ) if and only if w V ( p ) and if and only if w V ( p ) .
( f o r t h )
Let w Z w and s Σ ( w ) . Then, there is w such that w Z w and w Z w . Since Z is a bisimulation, there is s Σ ( w ) such that s Z ¯ s . Since Z is a bisimulation, there is s Σ ( w ) such that s Z ¯ s .
We claim that s Z ¯ s . Suppose u s . Since s Z ¯ s , there is u s such that u Z u , and since s Z ¯ s , there is u s such that u Z u . From this, it follows that u Z u . The second condition can be proved in a similar way.
( b a c k )
Similar to condition ( f o r t h ) .
Hence, Z = Z Z is a bisimulation. □
From the previous proposition, we obtain the following corollary:
Corollary 1.
Let M = ( W , Σ , V ) be an inquisitive modal model. The bisimilarity relation ∼ is an equivalence relation on W.
In the following proposition, we show that the union of bisimulations is a bisimulation.
Proposition 2.
Let M = ( W , Σ , V ) and M = ( W , Σ , V ) be inquisitive modal models. If { Z i : i I } is a set of bisimulations Z i W × W , then Z = i I Z i is a bisimulation.
Proof. 
( a t )
Let w Z w . Then, there is i I such that w Z i w . Since Z i is a bisimulation, it follows that w V ( p ) if and only if w V ( p ) .
( f o r t h )
Let w Z w and s Σ ( w ) . Then, there is i I such that w Z i w . Since Z i is a bisimulation, there is s Σ ( w ) such that s Z i ¯ s .
We claim that s Z ¯ s . Suppose u s . Since s Z i ¯ s , there is u s such that u Z i u . This implies u Z u . The second condition can be proved in a similar way.
( b a c k )
Similar to condition ( f o r t h ) .
Hence, Z = i I Z i is a bisimulation. □
The union of all bisimulations between inquisitive modal models M and M is clearly the largest bisimulation between these models.
Let M = ( W , Σ , V ) be an inquisitive modal model and let Z be the largest bisimulation on M . Since w Z u if and only if w u , it follows that Z is an equivalence relation. For w W , denote by [ w ] the equivalence class of an element w under the relation Z. Furthermore, for s W , let
[ s ] = { [ w ] : w s } .
Observe that if [ w ] [ s ] , then there is u s such that w Z u .
For the worlds, it holds that w Z u if and only if [ w ] = [ u ] . A similar result holds for the states, as expressed in the below proposition.
Proposition 3.
Let M = ( W , Σ , V ) be an inquisitive modal model and let Z be the largest bisimulation on M . Then, for all states s and s , we have
s Z ¯ s if and only if [ s ] = [ s ] .
Proof. 
First, suppose that s Z ¯ s . Let [ w ] [ s ] . Then, there is u s such that w Z u . Since s Z ¯ s , there is u s such that u Z u , so we have w Z u , i.e., [ w ] = [ u ] . Since u s , it follows that [ u ] [ s ] , so we have [ w ] [ s ] . Hence, [ s ] [ s ] . We can prove [ s ] [ s ] in a similar way.
Conversely, suppose that [ s ] = [ s ] . Let w s . Then, we have [ w ] [ s ] . This implies that [ w ] [ s ] . Then, there is u s such that w Z u . The second condition can be proved in a similar way, so we obtain s Z ¯ s . □

4. Bisimulation Quotient

Having shown that the bisimilarity relation is an equivalence relation on the set of worlds W of an inquisitive modal model M = ( W , Σ , V ) , we define the quotient of the model M with respect to the largest bisimulation.
Definition 6.
Let M = ( W , Σ , V ) be an inquisitive modal model and Z be the largest bisimulation on M . The model M Z = ( W Z , Σ Z , V Z ) is called the bisimulation quotient of M if the following conditions are satisfied:
  • W Z = { [ w ] : w W } ;
  • [ s ] Σ Z ( [ w ] ) if and only if there are w [ w ] and s with [ s ] = [ s ] such that s Σ ( w ) ;
  • [ w ] V Z ( p ) if and only if w V ( p ) for all p P .
It is easy to check whether the definition does not depend on the choice of representatives.
Now, we show that the bisimulation quotient is an inquisitive modal model. First, we have the following lemma:
Lemma 1.
Let M = ( W , Σ , V ) be an inquisitive modal model and Z be the largest bisimulation on M and t , s W . If [ t ] [ s ] , then there is t s such that [ t ] = [ t ] .
Proof. 
Let t = { w s : there is u t such that u Z w } . It is obvious that t s . We claim that [ t ] = [ t ] . It suffices to show t Z ¯ t . Suppose u t . Since [ t ] [ s ] , there is w s such that u Z w . Now, we have w t . Thus, for every u t , there is w t such that u Z w . Conversely, suppose w t . By the definition of the set t , there is u t such that u Z w . Hence, t Z ¯ t . □
Proposition 4.
Let M = ( W , Σ , V ) be an inquisitive modal model and Z be the largest bisimulation on M . The bisimulation quotient M Z = ( W Z , Σ Z , V Z ) is an inquisitive modal model.
Proof. 
We need to show that, for every w W , the sets Σ Z ( [ w ] ) are downward closed. So, let [ s ] Σ Z ( [ w ] ) and [ t ] [ s ] . From [ s ] Σ Z ( [ w ] ) , it follows that there are w [ w ] and s with [ s ] = [ s ] such that s Σ ( w ) . By the previous lemma, [ t ] [ s ] = [ s ] implies that there is t s such that [ t ] = [ t ] . Since M is an inquisitive modal model, t s and s Σ ( w ) imply that t Σ ( w ) . Now, we obtain [ t ] Σ Z ( [ w ] ) , i.e., [ t ] Σ Z ( [ w ] ) . Hence, the set Σ Z ( [ w ] ) is downward closed. □
Naturally, we expect a model to be connected to its bisimulation quotient by a surjective bounded morphism and thus by modal equivalence (cf. [6]). Here, we adapt this for the inquisitive modal logic InqML .
For s W , denote f ( s ) = { f ( w ) : w s } .
Definition 7.
Let M = ( W , Σ , V ) and M = ( W , Σ , V ) be inquisitive modal models. A function f : W W is called a bounded morphism of the models M and M if the following conditions are satisfied:
( a t b m )
w V ( p ) if and only if f ( w ) V ( p ) for all p P ;
( f o r t h b m )
If s Σ ( w ) , then f ( s ) Σ ( f ( w ) ) ;
( b a c k b m )
If s Σ ( f ( w ) ) , then there is s Σ ( w ) such that f ( s ) = s .
We now show that modal satisfaction is invariant under a bounded morphism, i.e., the below proposition holds.
Proposition 5.
Let M = ( W , Σ , V ) and M = ( W , Σ , V ) be inquisitive modal models and let f : W W be a bounded morphism of the models M and M . Then, for every s W and every formula φ L , we have
M , s φ   if and only if   M , f ( s ) φ .
Proof. 
Since bisimilar states are modally equivalent, it suffices to show that there is a bisimulation Z such that s Z ¯ f ( s ) . Let Z = { ( w , f ( w ) ) ) : w W } .
Suppose w Z f ( w ) . Then, we have w V ( p ) if and only if f ( w ) V ( p ) , so condition ( a t ) holds.
Suppose w Z f ( w ) and s Σ ( w ) . From condition ( f o r t h b m ) , it follows that f ( s ) Σ ( f ( w ) ) . We need to show that s Z ¯ f ( s ) . If u s , then for f ( u ) f ( s ) , we have u Z f ( u ) . Conversely, if u f ( s ) , then there is u s such that f ( u ) = u . This implies u Z f ( u ) , i.e., u Z u . Hence, condition ( f o r t h ) holds.
Suppose w Z f ( w ) and s Σ ( f ( w ) ) . From condition ( b a c k b m ) , it follows that there is s Σ ( w ) such that f ( s ) = s . As in the previous case, it can be proved that s Z ¯ s , so condition ( b a c k ) also holds.
Hence, Z is a bisimulation.
Let s W be an arbitrary state. Suppose u s . Then, for f ( u ) f ( s ) , we have u Z f ( u ) . Conversely, suppose u f ( s ) . Then, there is u s such that f ( u ) = u . Now, we have u Z f ( u ) , i.e., u Z u . Hence, s Z ¯ f ( s ) . □
Proposition 6.
The projection π : M M Z , π ( w ) = [ w ] , is a surjective bounded morphism.
Proof. 
It is obvious that π is surjective. Let us show that π is a bounded morphism:
( a t b m )
We have w V ( p ) if and only if [ w ] V Z ( p ) and if and only if π ( w ) V Z ( p ) .
( f o r t h b m )
Let s Σ ( w ) . Then, [ s ] Σ Z ( [ w ] ) , i.e., π ( s ) Σ Z ( π ( w ) ) , by the definition of the bisimulation quotient.
( b a c k b m )
Let [ s ] Σ Z ( π ( w ) ) , i.e., [ s ] Σ Z ( [ w ] ) . By the definition of the bisimulation quotient, there are w [ w ] and s with [ s ] = [ s ] such that s Σ ( w ) . By condition ( b a c k ) , w Z w and s Σ ( w ) imply that there is t with t Z ¯ s such that t Σ ( w ) . Now, [ s ] = [ s ] and [ t ] = [ s ] imply [ t ] = [ s ] . Hence, π ( t ) = [ s ] .
Thus, π is a surjective bounded morphism. □
The next corollary follows from the previous propositions.
Corollary 2.
Let M Z be the bisimulation quotient of an inquisitive modal model M . Then, for every state s, we have M , s M Z , [ s ] , i.e., the states s and [ s ] are modally equivalent.
For the rest of this section, we turn to the main result of the paper, which is also an analogue of a well-known result in basic modal logic (cf. [6]): two models are globally bisimilar if and only if their bisimulation quotients are isomorphic.
First, we define the notions of global bisimulation and isomorphism.
Definition 8.
Inquisitive modal models M = ( W , Σ , V ) and M = ( W , Σ , V ) are globally bisimilar if there is a bisimulation X such that for all w W , there is w W with w X w , and vice versa. In this case, X is called a global bisimulation.
Notice that of all models that are globally bisimilar to M , the bisimulation quotient M Z is in some sense minimal, since every other model that is globally bisimilar to M must contain at least one world for each class obtained by the relation Z.
Definition 9.
Let M = ( W , Σ , V ) and M = ( W , Σ , V ) be inquisitive modal models. The function f : W W is called an isomorphism of the models M and M if f is a bijection and the following conditions are satisfied:
( i )
w V ( p ) if and only if f ( w ) V ( p ) for all p P ;
( i i )
s Σ ( w ) if and only if f ( s ) Σ ( f ( w ) ) .
Before proving the main theorem, we need the following lemma.
Lemma 2.
Let M = ( W , Σ , V ) and M = ( W , Σ , V ) be inquisitive modal models, and let Z and Z be the largest bisimulations on M and M , respectively. Let f : W Z W Z be a function defined by
f ( [ w ] ) = [ w ]   if there exist   x [ w ] and x [ w ]   such that   x X x ,
where X is a global bisimulation between M and M .
Then the function f is well-defined, and for all states s and s , we have
f ( [ s ] ) = [ s ]   if and only if there exist   t with [ t ] = [ s ] and t with [ t ] = [ s ]   such that   t X ¯ t .
Proof. 
First, we show that f is well-defined. Suppose [ u ] = [ v ] , i.e., u Z v . We need to prove that f ( [ u ] ) = f ( [ v ] ) . Since X is a global bisimulation, there are u and v such that u X u and v X v . Then, we have f ( [ u ] ) = [ u ] and f ( [ v ] ) = [ v ] , so it suffices to show that [ u ] = [ v ] , i.e., u Z v . We have u X 1 u Z v X v , so u ( X 1 Z X ) v . Thus, u Z v since Z is the largest bisimulation on M .
Now, we prove the second claim of the lemma. Let f ( [ s ] ) = [ s ] . Suppose, for a contradiction, that for all t with [ t ] = [ s ] and t with [ t ] = [ s ] , it is not the case that t X ¯ t . In particular, for t = s and t = s , it is not the case that s X ¯ s . This means that there is either v s such that, for every v s , it is not the case that v X v , i.e., f ( [ v ] ) [ v ] , or there is v s such that, for all v s , it is not the case that v X v , i.e., f ( [ v ] ) [ v ] . Since [ v ] [ s ] for every v s and [ v ] [ s ] for every v s , we obtain a contradiction with f ( [ s ] ) = [ s ] in both cases.
Conversely, suppose that there are t with [ t ] = [ s ] and t with [ t ] = [ s ] such that t X ¯ t . This means that for every v t there is v t such that v X v , i.e., f ( [ v ] ) = [ v ] , and vice versa. Suppose, for a contradiction, that f ( [ s ] ) / [ s ] or [ s ] / f ( [ s ] ) .
Let f ( [ s ] ) / [ s ] . This means that there is [ v ] f ( [ s ] ) such that [ v ] [ s ] . Then, there is [ v ] [ s ] such that [ v ] = f ( [ v ] ) . Since [ v ] [ s ] = [ t ] , there is u t such that [ u ] = [ v ] , so we have [ v ] = f ( [ u ] ) . Since [ v ] [ s ] = [ t ] , it follows that f ( [ u ] ) [ t ] , so for every u t , we obtain [ u ] f ( [ u ] ) , which contradicts t X ¯ t .
Let [ s ] / f ( [ s ] ) . This means that there is [ v ] [ s ] such that [ v ] f ( [ s ] ) , i.e., [ v ] f ( [ v ] ) for every [ v ] [ s ] . Since [ v ] [ s ] = [ t ] , there is u t such that [ u ] = [ v ] , so we have [ u ] f ( [ v ] ) for every [ v ] [ s ] = [ t ] . Then, for every u t , we obtain [ u ] f ( [ u ] ) , which contradicts t X ¯ t . □
Now, we can prove that global bisimilarity between inquisitive modal models is characterized by isomorphism between their minimal versions.
Theorem 1.
Let M = ( W , Σ , V ) and M = ( W , Σ , V ) be inquisitive modal models, and let Z and Z be the largest bisimulations on M and M , respectively. The models M and M are globally bisimilar if and only if the bisimulation quotients M Z and M Z are isomorphic.
Proof. 
Let X be a global bisimulation between the models M and M . Let f : W Z W Z be the function defined by
f ( [ w ] ) = [ w ] if   there   exist   x [ w ] and x [ w ] such   that   x X x .
By the previous lemma, the function f is well-defined.
We first show the surjectivity of f. Let [ w ] W Z . Take any x [ w ] . Since X is a global bisimulation, there is w W such that w X x . Since w [ w ] , it follows that f ( [ w ] ) = [ w ] .
Now, we show the injectivity of f. Let f ( [ u ] ) = f ( [ v ] ) . Then, there are x [ u ] and x f ( [ v ] ) such that x X x . Since x [ u ] , it follows that u Z x , and since x f ( [ v ] ) , i.e., [ x ] = f ( [ v ] ) , there are y [ v ] and y [ x ] such that y X y . From y [ v ] , it follows that y Z v , and since y [ x ] , we obtain y Z x . Now, we have u Z x X x Z 1 y X 1 y Z v , so u ( Z X Z 1 X 1 Z ) v . Thus, u Z v , since Z is the largest bisimulation on M . Hence, [ u ] = [ v ] .
It remains to prove ( i ) and ( i i ) to show that f is an isomorphism:
( i )
Let [ w ] V Z ( p ) . Then, w V ( p ) . Since X is a global bisimulation, there is w W such that w X w . Now, we have f ( [ w ] ) = [ w ] and w V ( p ) , so f ( [ w ] ) V Z ( p ) . The converse is proved in a similar way.
( i i )
Let [ s ] Σ Z ( [ w ] ) . Then, there are x [ w ] and t with [ t ] = [ s ] such that t Σ ( x ) . Since X is a global bisimulation, there is x W such that x X x , so by condition ( f o r t h ) of the bisimulation X, there is t Σ ( x ) such that t X ¯ t .
Now, x [ w ] and x X x imply [ x ] = [ w ] and f ( [ x ] ) = [ x ] , so we obtain f ( [ w ] ) = [ x ] . Similarly, since t X ¯ t , by the previous lemma, we obtain f ( [ t ] ) = [ t ] , so from [ t ] = [ s ] , it follows that f ( [ s ] ) = [ t ] . Now, x f ( [ w ] ) , [ t ] = f ( [ s ] ) and t Σ ( x ) imply f ( [ s ] ) Σ Z ( f ( [ w ] ) ) .
Conversely, suppose f ( [ s ] ) Σ Z ( f ( [ w ] ) ) . Then, there are x f ( [ w ] ) and t with [ t ] = f ( [ s ] ) such that t Σ ( x ) . Since X is a global bisimulation, there is x W such that x X x , so by condition ( b a c k ) of the bisimulation X, there is t Σ ( x ) such that t X ¯ t .
Since x f ( [ w ] ) , i.e., [ x ] = f ( [ w ] ) , by the definition of f, there are y [ w ] and y [ x ] such that y X y . Now, we have x X x Z y X 1 y Z w , so x ( X Z X 1 Z ) w and thus x Z w since Z is the largest bisimulation on M .
Similarly, from [ t ] = f ( [ s ] ) , it follows by the previous lemma that there are r with [ r ] = [ s ] and r with [ r ] = [ t ] such that r X ¯ r . Then, we have t X ¯ t Z ¯ r X 1 ¯ r Z ¯ s , so t ( X ¯ Z ¯ X 1 ¯ Z ¯ ) s and thus t Z ¯ s since Z is the largest bisimulation on M .
Now, from x Z w and t Z ¯ s , it follows that x [ w ] and [ t ] = [ s ] , so, since t Σ ( x ) , we obtain [ s ] Σ Z ( [ w ] ) .
Hence, f is an isomorphism.
For the converse, let f : W Z W Z be an isomorphism of the models M Z and M Z . We define a relation X W × W by
w X w if   and   only   if   f ( [ w ] ) = [ w ] .
We claim that X is a global bisimulation.
Suppose w W . Then, there is w W such that f ( [ w ] ) = [ w ] , so we obtain w X w . Conversely, suppose w W . By the surjectivity of f, there is [ w ] W Z such that f ( [ w ] ) = [ w ] , so we obtain w X w . This shows the globality of the relation X.
It remains to show that X is a bisimulation:
( a t )
Let w X w . From the definitions of bisimulation quotient and isomorphism and from the claim f ( [ w ] ) = [ w ] , it follows that w V ( p ) if and only if [ w ] V Z ( p ) if and only if f ( [ w ] ) V Z ( p ) if and only if [ w ] V Z ( p ) if and only if w V ( p ) .
( f o r t h )
Let w X w and s Σ ( w ) . We need to find s Σ ( w ) such that s X ¯ s .
By the definition of the bisimulation quotient, we have [ s ] Σ Z ( [ w ] ) and, since f is an isomorphism, it follows that f ( [ s ] ) Σ Z ( f ( [ w ] ) ) , i.e., f ( [ s ] ) Σ Z ( [ w ] ) ) . This means that there are x [ w ] and t W with [ t ] = f ( [ s ] ) such that t Σ ( x ) . Since x [ w ] , we have x Z w , so, since t Σ ( x ) , by the condition ( f o r t h ) of the bisimulation Z , there is s Σ ( w ) such that t Z ¯ s . Now, t Z ¯ s implies [ t ] = [ s ] , so by [ t ] = f ( [ s ] ) , we obtain [ s ] = f ( [ s ] ) .
It remains to show s X ¯ s . Suppose v s . Then, [ v ] [ s ] , so we have f ( [ v ] ) f ( [ s ] ) . Now, we have f ( [ v ] ) [ s ] , so there is [ u ] [ s ] such that f ( [ v ] ) = [ u ] . Since [ u ] [ s ] , there is v s such that [ u ] = [ v ] , so we obtain f ( [ v ] ) = [ v ] . Hence, v X v . The converse can be proved in a similar way, so we have s X ¯ s .
( b a c k )
Similar to condition ( f o r t h ) .
Hence, X is a global bisimulation. □

5. Conclusions and Future Work

The field of inquisitive modal logic has grown in recent years, and it continues to develop further. In this paper, we make a new contribution to the model theory of inquisitive modal logic. We investigate the notion of bisimulation in InqML and show some of its basic properties. Moreover, we define the bisimulation quotient and show that an inquisitive modal model is related to its bisimulation quotient by modal equivalence. We also prove that two models are globally bisimilar if and only if their bisimulation quotients are isomorphic. These results are well-known in basic modal logic (as well as in several other logics). However, since inquisitive modal logic has a more complex semantics in which not only sets of worlds but also sets of sets of worlds are considered, it is important to verify whether these results hold here and whether the standard proof techniques can be adapted to this logic.
The logic InqML was generalized to the inquisitive modal logic InqML in [11]. The language of InqML is based on a binary modal operator ⇛, and the formulas of InqML are interpreted over models that do not require a downward closure condition. It is expected that the results of this work can be generalized to the inquisitive modal logic InqML .

Funding

This research was funded by Croatian Science Foundation grant number IP-2024-05-3882.

Institutional Review Board Statement

Not applicable.

Data Availability Statement

The original contributions presented in this study are included in the article. Further inquiries can be directed to the corresponding author.

Acknowledgments

I am grateful to the anonymous reviewers for their valuable suggestions and corrections.

Conflicts of Interest

The author declares no conflicts of interest.

Notes

1
This means that inquisitive logic is part of the broader class of logics based on team semantics.
2
A neighborhood model is a structure in which each world is associated with a set of neighborhoods, where the neighborhood is a set of worlds.

References

  1. Ciardelli, I.; Roelofsen, F. Inquisitive dynamic epistemic logic. Synthese 2021, 192, 1643–1687. [Google Scholar] [CrossRef]
  2. Ciardelli, I. Questions in Logic. Ph.D. Thesis, Institute for Logic, Language and Computation, University of Amsterdam, Amsterdam, The Netherlands, 2016. [Google Scholar]
  3. Ciardelli, I.; Otto, M. Inquisitive bisimulation. J. Symb. Log. 2021, 86, 77–109. [Google Scholar] [CrossRef]
  4. Marić, S.; Perkov, T. Decidability of Inquisitive Modal Logic via Filtrations. Stud. Log. 2024. [Google Scholar] [CrossRef]
  5. Meissner, S.; Otto, M. A first-order framework for inquisitive modal logic. Rev. Symb. Log. 2021, 15, 311–333. [Google Scholar] [CrossRef]
  6. Goranko, V.; Otto, M. Model theory of modal logic. In Handbook of Modal Logic; Blackburn, P., Wolter, F., van Benthem, J., Eds.; Elsevier: Amsterdam, The Netherlands, 2007; pp. 249–329. [Google Scholar]
  7. Kontinen, J.; Müller, J.S.; Schnoor, H.; Vollmer, H. A van Benthem theorem for modal team semantics. In Proceedings of CSL 24; Kreutzer, S., Ed.; Leibniz International Proceedings in Informatics; Deutsche Nationalbibliothek: Leipzig, Germany, 2015; pp. 277–291. [Google Scholar]
  8. Pacuit, E. Neighborhood Semantics for Modal Logic; Springer: Cham, Switzerland, 2017. [Google Scholar]
  9. Hansen, H.H.; Kupke, C.; Pacuit, E. Neighbourhood structures: Bisimilarity and basic model theory. Log. Methods Comput. Sci. 2009, 5, 1–38. [Google Scholar] [CrossRef]
  10. Hansen, H.H. Monotonic Modal Logics. Master’s Thesis, University of Amsterdam, Amsterdam, The Netherlands, 2003. [Google Scholar]
  11. Ciardelli, I. Describing neighborhoods in inquisitive modal logic. Adv. Modal Log. 2022, 14, 217–236. [Google Scholar]
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Article Metrics

Citations

Article Access Statistics

Multiple requests from the same IP address are counted as one view.