• Images
• Videos
• Documents
• Books
• Articles

Definition

Modal depth can be defined as follows.¹ Let MD ⁡ ( ϕ ) {\displaystyle \operatorname {MD} (\phi )} be a function that computes the modal depth for a modal formula ϕ {\displaystyle \phi } :

MD ⁡ ( p ) = 0 {\displaystyle \operatorname {MD} (p)=0} , where p {\displaystyle p} is an atomic formula. MD ⁡ ( ⊤ ) = 0 {\displaystyle \operatorname {MD} (\top )=0} MD ⁡ ( ⊥ ) = 0 {\displaystyle \operatorname {MD} (\bot )=0} MD ⁡ ( ¬ φ ) = MD ⁡ ( φ ) {\displaystyle \operatorname {MD} (\neg \varphi )=\operatorname {MD} (\varphi )} MD ⁡ ( φ ∧ ψ ) = max ( MD ⁡ ( φ ) , MD ⁡ ( ψ ) ) {\displaystyle \operatorname {MD} (\varphi \wedge \psi )=\max(\operatorname {MD} (\varphi ),\operatorname {MD} (\psi ))} MD ⁡ ( φ ∨ ψ ) = max ( MD ⁡ ( φ ) , MD ⁡ ( ψ ) ) {\displaystyle \operatorname {MD} (\varphi \vee \psi )=\max(\operatorname {MD} (\varphi ),\operatorname {MD} (\psi ))} MD ⁡ ( φ → ψ ) = max ( MD ⁡ ( φ ) , MD ⁡ ( ψ ) ) {\displaystyle \operatorname {MD} (\varphi \rightarrow \psi )=\max(\operatorname {MD} (\varphi ),\operatorname {MD} (\psi ))} MD ⁡ ( ◻ φ ) = 1 + MD ⁡ ( φ ) {\displaystyle \operatorname {MD} (\Box \varphi )=1+\operatorname {MD} (\varphi )} MD ⁡ ( ◊ φ ) = 1 + MD ⁡ ( φ ) {\displaystyle \operatorname {MD} (\Diamond \varphi )=1+\operatorname {MD} (\varphi )}

Example

The following computation gives the modal depth of ◻ ( ◻ p → p ) {\displaystyle \Box (\Box p\rightarrow p)} :

MD ⁡ ( ◻ ( ◻ p → p ) ) {\displaystyle \operatorname {MD} (\Box (\Box p\rightarrow p))} = 1 + MD ⁡ ( ◻ p → p ) {\displaystyle =1+\operatorname {MD} (\Box p\rightarrow p)} = 1 + max ( MD ⁡ ( ◻ p ) , MD ⁡ ( p ) ) {\displaystyle =1+\max(\operatorname {MD} (\Box p),\operatorname {MD} (p))} = 1 + max ( 1 + MD ⁡ ( p ) , 0 ) {\displaystyle =1+\max(1+\operatorname {MD} (p),0)} = 1 + max ( 1 + 0 , 0 ) {\displaystyle =1+\max(1+0,0)} = 1 + 1 {\displaystyle =1+1} = 2 {\displaystyle =2}

Modal depth and semantics

The modal depth of a formula indicates 'how far' one needs to look in a Kripke model when checking the validity of the formula. For each modal operator, one needs to transition from a world in the model to a world that is accessible through the accessibility relation. The modal depth indicates the longest 'chain' of transitions from a world to the next that is needed to verify the validity of a formula.

For example, to check whether M , w ⊨ ◊ ◊ φ {\displaystyle M,w\models \Diamond \Diamond \varphi } , one needs to check whether there exists an accessible world v {\displaystyle v} for which M , v ⊨ ◊ φ {\displaystyle M,v\models \Diamond \varphi } . If that is the case, one needs to check whether there is also a world u {\displaystyle u} such that M , u ⊨ φ {\displaystyle M,u\models \varphi } and u {\displaystyle u} is accessible from v {\displaystyle v} . We have made two steps from the world w {\displaystyle w} (from w {\displaystyle w} to v {\displaystyle v} and from v {\displaystyle v} to u {\displaystyle u} ) in the model to determine whether the formula holds; this is, by definition, the modal depth of that formula.

The modal depth is an upper bound (inclusive) on the number of transitions as for boxes, a modal formula is also true whenever a world has no accessible worlds (i.e., ◻ φ {\displaystyle \Box \varphi } holds for all φ {\displaystyle \varphi } in a world w {\displaystyle w} when ∀ v ∈ W   ( w , v ) ∉ R {\displaystyle \forall v\in W\ (w,v)\not \in R} , where W {\displaystyle W} is the set of worlds and R {\displaystyle R} is the accessibility relation). To check whether M , w ⊨ ◻ ◻ φ {\displaystyle M,w\models \Box \Box \varphi } , it may be needed to take two steps in the model but it could be less, depending on the structure of the model. Suppose no worlds are accessible in w {\displaystyle w} ; the formula now trivially holds by the previous observation about the validity of formulas with a box as outer operator.

References

1. Nguyen, Linh Anh. "Constructing the Least Models for Positive Modal Logic Programs" (PDF). p. 32. Archived from the original (PDF) on January 26, 2019. Retrieved January 26, 2019. https://web.archive.org/web/20190126163820/https://www.mimuw.edu.pl/~nguyen/least.pdf ↩