Standard translation is defined as follows:

• ${\displaystyle ST_{x}(p)\equiv P(x)}$ , where ${\displaystyle p}$  is an atomic formula; P(x) is true when ${\displaystyle p}$  holds in world ${\displaystyle x}$ .
• ${\displaystyle ST_{x}(\top )\equiv \top }$ 
• ${\displaystyle ST_{x}(\bot )\equiv \bot }$ 
• ${\displaystyle ST_{x}(\neg \varphi )\equiv \neg ST_{x}(\varphi )}$ 
• ${\displaystyle ST_{x}(\varphi \wedge \psi )\equiv ST_{x}(\varphi )\wedge ST_{x}(\psi )}$ 
• ${\displaystyle ST_{x}(\varphi \vee \psi )\equiv ST_{x}(\varphi )\vee ST_{x}(\psi )}$ 
• ${\displaystyle ST_{x}(\varphi \rightarrow \psi )\equiv ST_{x}(\varphi )\rightarrow ST_{x}(\psi )}$ 
• ${\displaystyle ST_{x}(\Diamond _{m}\varphi )\equiv \exists y(R_{m}(x,y)\wedge ST_{y}(\varphi ))}$ 
• ${\displaystyle ST_{x}(\Box _{m}\varphi )\equiv \forall y(R_{m}(x,y)\rightarrow ST_{y}(\varphi ))}$ 

In the above, ${\displaystyle x}$  is the world from which the formula is evaluated. Initially, a free variable ${\displaystyle x}$  is used and whenever a modal operator needs to be translated, a fresh variable is introduced to indicate that the remainder of the formula needs to be evaluated from that world. Here, the subscript ${\displaystyle m}$  refers to the accessibility relation that should be used: normally, ${\displaystyle \Box }$  and ${\displaystyle \Diamond }$  refer to a relation ${\displaystyle R}$  of the Kripke model but more than one accessibility relation can exist (a multimodal logic) in which case subscripts are used. For example, ${\displaystyle \Box _{a}}$  and ${\displaystyle \Diamond _{a}}$  refer to an accessibility relation ${\displaystyle R_{a}}$  and ${\displaystyle \Box _{b}}$  and ${\displaystyle \Diamond _{b}}$  to ${\displaystyle R_{b}}$  in the model. Alternatively, it can also be placed inside the modal symbol.

As an example, when standard translation is applied to ${\displaystyle \Box \Box p}$ , we expand the outer box to get

${\displaystyle \forall y(R(x,y)\rightarrow ST_{y}(\Box p))}$ 

meaning that we have now moved from ${\displaystyle x}$  to an accessible world ${\displaystyle y}$  and we now evaluate the remainder of the formula, ${\displaystyle \Box p}$ , in each of those accessible worlds.

The whole standard translation of this example becomes

${\displaystyle \forall y(R(x,y)\rightarrow (\forall z(R(y,z)\rightarrow P(z))))}$ 

which precisely captures the semantics of two boxes in modal logic. The formula ${\displaystyle \Box \Box p}$  holds in ${\displaystyle x}$  when for all accessible worlds ${\displaystyle y}$  from ${\displaystyle x}$  and for all accessible worlds ${\displaystyle z}$  from ${\displaystyle y}$ , the predicate ${\displaystyle P}$  is true for ${\displaystyle z}$ . Note that the formula is also true when no such accessible worlds exist. In case ${\displaystyle x}$  has no accessible worlds then ${\displaystyle R(x,y)}$  is false but the whole formula is vacuously true: an implication is also true when the antecedent is false.

The modal depth of a formula also becomes apparent in the translation to first-order logic. When the modal depth of a formula is k, then the first-order logic formula contains a 'chain' of k transitions from the starting world ${\displaystyle x}$ . The worlds are 'chained' in the sense that these worlds are visited by going from accessible to accessible world. Informally, the number of transitions in the 'longest chain' of transitions in the first-order formula is the modal depth of the formula.

The modal depth of the formula used in the example above is two. The first-order formula indicates that the transitions from ${\displaystyle x}$  to ${\displaystyle y}$  and from ${\displaystyle y}$  to ${\displaystyle z}$  are needed to verify the validity of the formula. This is also the modal depth of the formula as each modal operator increases the modal depth by one.

• Patrick Blackburn and Johan van Benthem (1988), Modal Logic: A Semantic Perspective.