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 worlds
1.
The inquisitive modal logic
is a generalization of the basic modal logic with a new modal operator ⊞, called
window. The logic
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
was systematically elaborated in [
2], while in [
3,
4,
5], various results in the model theory of
were presented. In particular, in [
3] the notions of bisimulation and bisimulation games were defined, as was the standard translation from
to two-sorted first-order logic. Furthermore, analogues of the Ehrenfeucht–Fraïssé theorem and the van Benthem characterization theorem for
were proved. In [
5], using so-called pseudo-models and an alternative definition of the standard translation, the compactness of
was proved in a purely model-theoretic way and a Hennessy–Milner class for
was defined. In [
4], the finite model property of
was proved via filtrations, and as a consequence, the decidability of
was obtained.
This paper deals with the bisimulation quotients and thus makes a further contribution to the model theory of
. 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 . We first show that for a given inquisitive modal model , the bisimilarity relation is an equivalence relation on W and that 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
. 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 . Furthermore, an inquisitive state over W is a non-empty set of information states that is downward closed, i.e., if and , then .
Definition 1. Let be a set of propositional variables. An inquisitive modal model is a triple , where W is a set of worlds, is a function that to each world w assigns an inquisitive state , and is a function that to each propositional variable assigns a set of worlds.
The language
of inquisitive modal logic
is given as follows:
We take negation and disjunction as defined connectives in the usual way:
Furthermore, we use the following abbreviation:
Definition 2 (Semantics of
)
. Let be an inquisitive modal model. The relation of support between states in and formulas of is defined as follows:
;
;
and ;
, implies ;
or ;
, , .
A formula is true at a world w in an inquisitive modal model , denoted , if .
The modality ⊞ can be seen as a natural counterpart to the standard modal operator □. To illustrate this, consider a Kripke model for basic modal logic. The accessibility relation R can equivalently be viewed as a function that assigns to each world w the set of worlds accessible from w. Thus, we have if and only if , where denotes the set of worlds where is true.
In inquisitive modal logic, the function is replaced by a function , 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 if and only if . 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 be an inquisitive modal model. A state is compatible with a formula if there is , such that . Using this notion, the support conditions for the connectives ¬ and ∨ can be expressed as follows:
is not compatible with ;
for all , , 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 be an inquisitive modal model, with and propositional variables. Then, for the formulas and , the following holds:
or or for all , so we have or for all , we have for all , we have or for all , and we have ;
for all , so we have t is compatible with p or t is compatible with q⇔ for all , we have is compatible with p or is compatible with q⇔ for all , and we have or .
It is easy to show that the following properties hold:
Persistence: ;
Empty state property: .
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 is truth-conditional if, for all , the following holds: We regard truth-conditional formulas as statements, and non-truth-conditional formulas as questions.
Example 2. Let be an inquisitive modal model, where , , and for the propositional variable p. Consider the formula . Although and , we have . Hence, the formula is a question.
The
set of declarative formulas is defined as follows:
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: 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 is equivalent to the formula . On the other hand, using the operator , it is possible to obtain a statement that has no counterpart in basic modal logic (e.g., ). 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
, see [
2].
3. The Bisimilarity Relation
As previously mentioned, bisimulation in inquisitive modal logic
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 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 , while a state s can be associated with a world . Therefore, the definition of bisimulation in must be such that it takes both types of transitions into account.
Let
and
be inquisitive modal models. The conditions under which a relation
Z can be considered a bisimulation are as follows: First, if
and
are worlds such that
, then the same propositional variables must be true at both worlds. Second, if
, then for each state
, there must exist a state
such that
, and vice versa. Third, if
, then for each
, there must exist
such that
, and vice versa. A bisimulation
Z should therefore be a relation
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
. In this paper, we will use this formulation. For this purpose, we first define the below relation.
The lifting of a relation is the relation defined with if and only if the following conditions are satisfied:
For all , there is such that ;
For all , there is such that .
The purpose of the relation is to define how subsets of two sets relate to each other based on a binary relation between their elements. Furthermore, the relation is clearly uniquely determined by Y.
Remark 2. Notice that for a relation , we have . Furthermore, if and are relations, then .
Now, we can define the notion of bisimulation in
(cf. [
3]).
Definition 4. Let and be inquisitive modal models. A non-empty relation is called a bisimulation if the following conditions are satisfied:
- (at)
If , then if and only if , for all ;
- (forth)
If and , then there is such that ;
- (back)
If and , then there is such that .
We say that the worlds w and are bisimilar, denoted by , if there exists a bisimulation Z such that .
We say that the states s and are bisimilar, denoted by , if there exists a bisimulation Z such that .
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 , each world is connected to information states. Therefore, the notions of bisimilarity between worlds and bisimilarity between states in 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 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], 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 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 and be inquisitive modal models. The states s and are modally equivalent, denoted by , if for every formula the following holds: 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
is proved, showing that, assuming a finite set of propositional variables, the finite levels
of bisimulation correspond to the levels of modal equivalence up to a modal depth of at most
n.
Let
be an inquisitive modal model. Consider the bisimilarity relation between worlds in
W, i.e., the relation defined as follows:
The first goal is to prove that the bisimilarity relation ∼ is an equivalence relation, which leads to the below proposition.
Proposition 1. Let , , and be inquisitive modal models. Then, the following hold:
The relation is a bisimulation;
If is a bisimulation, then is a bisimulation;
If and are bisimulations, then is a bisimulation.
Proof. Claims and are straightforward, so we focus on proving claim . We show that Z satisfies the conditions , and :
Let . Then, there is such that and . Since and are bisimulations, it follows that if and only if and if and only if .
Let and . Then, there is such that and . Since is a bisimulation, there is such that . Since is a bisimulation, there is such that .
We claim that . Suppose . Since , there is such that , and since , there is such that . From this, it follows that . The second condition can be proved in a similar way.
Similar to condition .
Hence, is a bisimulation. □
From the previous proposition, we obtain the following corollary:
Corollary 1. Let 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 and be inquisitive modal models. If is a set of bisimulations , then is a bisimulation.
Proof. Let . Then, there is such that . Since is a bisimulation, it follows that if and only if .
Let and . Then, there is such that . Since is a bisimulation, there is such that .
We claim that . Suppose . Since , there is such that . This implies . The second condition can be proved in a similar way.
Similar to condition .
Hence, is a bisimulation. □
The union of all bisimulations between inquisitive modal models and is clearly the largest bisimulation between these models.
Let
be an inquisitive modal model and let
Z be the largest bisimulation on
. Since
if and only if
, it follows that
Z is an equivalence relation. For
, denote by
the equivalence class of an element
w under the relation
Z. Furthermore, for
, let
Observe that if , then there is such that .
For the worlds, it holds that if and only if . A similar result holds for the states, as expressed in the below proposition.
Proposition 3. Let be an inquisitive modal model and let Z be the largest bisimulation on . Then, for all states s and , we have Proof. First, suppose that . Let . Then, there is such that . Since , there is such that , so we have , i.e., . Since , it follows that , so we have . Hence, . We can prove in a similar way.
Conversely, suppose that . Let . Then, we have . This implies that . Then, there is such that . The second condition can be proved in a similar way, so we obtain . □
4. Bisimulation Quotient
Having shown that the bisimilarity relation is an equivalence relation on the set of worlds W of an inquisitive modal model , we define the quotient of the model with respect to the largest bisimulation.
Definition 6. Let be an inquisitive modal model and Z be the largest bisimulation on . The model is called the bisimulation quotient of if the following conditions are satisfied:
;
if and only if there are and with such that ;
if and only if for all .
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 be an inquisitive modal model and Z be the largest bisimulation on and . If , then there is such that .
Proof. Let . It is obvious that . We claim that . It suffices to show . Suppose . Since , there is such that . Now, we have . Thus, for every , there is such that . Conversely, suppose . By the definition of the set , there is such that . Hence, . □
Proposition 4. Let be an inquisitive modal model and Z be the largest bisimulation on . The bisimulation quotient is an inquisitive modal model.
Proof. We need to show that, for every , the sets are downward closed. So, let and . From , it follows that there are and with such that . By the previous lemma, implies that there is such that . Since is an inquisitive modal model, and imply that . Now, we obtain , i.e., . Hence, the set 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
.
For , denote .
Definition 7. Let and be inquisitive modal models. A function is called a bounded morphism of the models and if the following conditions are satisfied:
if and only if for all ;
If , then ;
If , then there is such that .
We now show that modal satisfaction is invariant under a bounded morphism, i.e., the below proposition holds.
Proposition 5. Let and be inquisitive modal models and let be a bounded morphism of the models and . Then, for every and every formula , we have Proof. Since bisimilar states are modally equivalent, it suffices to show that there is a bisimulation Z such that . Let .
Suppose . Then, we have if and only if , so condition holds.
Suppose and . From condition , it follows that . We need to show that . If , then for , we have . Conversely, if , then there is such that . This implies , i.e., . Hence, condition holds.
Suppose and . From condition , it follows that there is such that . As in the previous case, it can be proved that , so condition also holds.
Hence, Z is a bisimulation.
Let be an arbitrary state. Suppose . Then, for , we have . Conversely, suppose . Then, there is such that . Now, we have , i.e., . Hence, . □
Proposition 6. The projection , , is a surjective bounded morphism.
Proof. It is obvious that is surjective. Let us show that is a bounded morphism:
We have if and only if and if and only if .
Let . Then, , i.e., , by the definition of the bisimulation quotient.
Let , i.e., . By the definition of the bisimulation quotient, there are and with such that . By condition , and imply that there is t with such that . Now, and imply . Hence, .
Thus, is a surjective bounded morphism. □
The next corollary follows from the previous propositions.
Corollary 2. Let be the bisimulation quotient of an inquisitive modal model . Then, for every state s, we have , i.e., the states s and 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 and are globally bisimilar if there is a bisimulation X such that for all , there is with , and vice versa. In this case, X is called a global bisimulation.
Notice that of all models that are globally bisimilar to , the bisimulation quotient is in some sense minimal, since every other model that is globally bisimilar to must contain at least one world for each class obtained by the relation Z.
Definition 9. Let and be inquisitive modal models. The function is called an isomorphism of the models and if f is a bijection and the following conditions are satisfied:
if and only if for all ;
if and only if .
Before proving the main theorem, we need the following lemma.
Lemma 2. Let and be inquisitive modal models, and let Z and be the largest bisimulations on and , respectively. Let be a function defined bywhere X is a global bisimulation between and . Then the function f is well-defined, and for all states s and , we have Proof. First, we show that f is well-defined. Suppose , i.e., . We need to prove that . Since X is a global bisimulation, there are and such that and . Then, we have and , so it suffices to show that , i.e., . We have , so . Thus, since is the largest bisimulation on .
Now, we prove the second claim of the lemma. Let . Suppose, for a contradiction, that for all t with and with , it is not the case that In particular, for and , it is not the case that . This means that there is either such that, for every , it is not the case that , i.e., , or there is such that, for all , it is not the case that , i.e., . Since for every and for every , we obtain a contradiction with in both cases.
Conversely, suppose that there are t with and with such that . This means that for every there is such that , i.e., , and vice versa. Suppose, for a contradiction, that or .
Let . This means that there is such that . Then, there is such that . Since , there is such that , so we have . Since it follows that , so for every , we obtain , which contradicts .
Let . This means that there is such that , i.e., for every . Since , there is such that , so we have for every . Then, for every , we obtain , which contradicts . □
Now, we can prove that global bisimilarity between inquisitive modal models is characterized by isomorphism between their minimal versions.
Theorem 1. Let and be inquisitive modal models, and let Z and be the largest bisimulations on and , respectively. The models and are globally bisimilar if and only if the bisimulation quotients and are isomorphic.
Proof. Let
X be a global bisimulation between the models
and
. Let
be the function defined by
By the previous lemma, the function
f is well-defined.
We first show the surjectivity of f. Let . Take any . Since X is a global bisimulation, there is such that . Since , it follows that .
Now, we show the injectivity of f. Let . Then, there are and such that . Since , it follows that , and since , i.e., , there are and such that . From , it follows that , and since , we obtain . Now, we have , so . Thus, , since Z is the largest bisimulation on . Hence, .
It remains to prove and to show that f is an isomorphism:
Let . Then, . Since X is a global bisimulation, there is such that . Now, we have and , so . The converse is proved in a similar way.
Let . Then, there are and t with such that . Since X is a global bisimulation, there is such that , so by condition of the bisimulation X, there is such that .
Now, and imply and , so we obtain . Similarly, since , by the previous lemma, we obtain , so from , it follows that . Now, , and imply .
Conversely, suppose . Then, there are and with such that . Since X is a global bisimulation, there is such that , so by condition of the bisimulation X, there is such that .
Since , i.e., , by the definition of f, there are and such that . Now, we have , so and thus since Z is the largest bisimulation on .
Similarly, from , it follows by the previous lemma that there are r with and with such that . Then, we have , so and thus since Z is the largest bisimulation on .
Now, from and , it follows that and , so, since , we obtain .
Hence, f is an isomorphism.
For the converse, let
be an isomorphism of the models
and
. We define a relation
by
We claim that X is a global bisimulation.
Suppose . Then, there is such that , so we obtain . Conversely, suppose . By the surjectivity of f, there is such that , so we obtain . This shows the globality of the relation X.
It remains to show that X is a bisimulation:
Let . From the definitions of bisimulation quotient and isomorphism and from the claim , it follows that if and only if if and only if if and only if if and only if .
Let and . We need to find such that .
By the definition of the bisimulation quotient, we have and, since f is an isomorphism, it follows that , i.e., . This means that there are and with such that . Since , we have , so, since , by the condition of the bisimulation , there is such that . Now, implies , so by , we obtain .
It remains to show . Suppose . Then, , so we have . Now, we have , so there is such that . Since , there is such that , so we obtain . Hence, . The converse can be proved in a similar way, so we have .
Similar to condition .
Hence, X is a global bisimulation. □