modal logic S5

The modal logic S5 is the smallest normal modal logic containing the following schemas:

• (T) $\mathrm{\square }A\to A$, and

• (5) $\diamond A\to \mathrm{\square }\diamond A$.

S5 is also denoted by KT5, where T and 5 correspond to the schemas T and 5 respectively.

In this entry (http://planetmath.org/ModalLogicT), we show that T is valid in a frame iff the frame is reflexive.

A binary relation $R$ on a set $W$ is said to be Euclidean iff for any $u,v,w$, $uRv$ and $uRw$ imply $vRw$. $R$ being Euclidean is first-order definable:

$$\forall u\forall v\forall w((uRv\wedge uRw)\to vRw).$$

Proposition 1.

5 is valid in a frame $\mathrm{F}$ iff $\mathrm{F}$ is Euclidean.

Proof.

First, let $ℱ$ be a frame validating 5. Suppose $wRx$ and $wRy$. Let $M$ be a model based on $ℱ$, with $V(p)=\{x\}$. Since ${\vDash }_{x}p$, we have ${\vDash }_w\diamond p$, and so ${\vDash }_w\mathrm{\square }\diamond p$, or ${\vDash }_u\diamond p$ for all $u$ such that $wRu$. In particular, ${\vDash }_y\diamond p$. So there is a $z$ such that $yRz$ and ${\vDash }_{z}p$. But this means $z=x$, whence $yRx$, meaning $R$ is Euclidean.

Conversely, suppose $ℱ$ is a Euclidean frame, and $M$ a model based on $ℱ$. Suppose ${\vDash }_w\diamond A$. Then there is a $v$ such that $wRv$ and ${\vDash }_{v}A$. Now, for any $u$ with $wRu$, we have $uRv$ since $R$ is Euclidean. So ${\vDash }_u\diamond A$. Since $u$ is arbitrary, ${\vDash }_w\mathrm{\square }\diamond A$, and therefore ${\vDash }_w\diamond A\to \mathrm{\square }\diamond A$. ∎

Now, a relation is both reflexive and Euclidean iff it is an equivalence relation:

Proof.

Suppose $R$ is both reflexive and Euclidean. If $aRb$, since $aRa$, $bRa$ so $R$ is symmetric. If $aRb$ and $bRc$, then $bRa$ since $R$ has just been proven symmetric, and therefore $aRc$, or $R$ is transitive. Conversely, suppose $R$ is an equivalence relation. If $aRb$ and $aRc$, then $bRa$ since $R$ is symmetric, so that $bRc$ since $R$ is transitive. Hence $R$ is Euclidean. ∎

This also shows that

S5 $=$ KTB4,

where B is the schema $A\to \mathrm{\square }\diamond A$, valid in any symmetric frame (see here (http://planetmath.org/ModalLogicB)), and 4 is the schema $\mathrm{\square }A\to \mathrm{\square }\mathrm{\square }A$, valid in any transitive frame (see here (http://planetmath.org/ModalLogicS4)). It is also not hard to show that

S5 $=$ KDB4 $=$ KDB5,

where $D$ is the schema $\mathrm{\square }A\to \diamond A$, valid in any serial frame (see here (http://planetmath.org/ModalLogicD)).

As a result,

Proposition 2.

S5 is sound in the class of equivalence frames.

Proof.

Since any theorem $A$ in S5 is deducible from a finite sequence consisting of tautologies, which are valid in any frame, instances of T, which are valid in reflexive frames, instances of 5, which are valid in Euclidean frames by the proposition above, and applications of modus ponens and necessitation, both of which preserve validity in any frame, $A$ is valid in any frame which is both reflexive and Euclidean, and hence an equivalence frame. ∎

In addition, using the canonical model of S5, which is based on an equivalence frame, we have

Proposition 3.

S5 is complete in the class of equivalence frames.

Proof.

By the discussion above, it is enough to show that the canonical frame of S5 is reflexive, symmetric, and transitive. Since S5 contains T, B, and 4, ${ℱ}_{\text{𝐒𝟓}}$ is reflexive, symmetric, and transitive respectively, the proofs of which can be found in the corresponding entries on T, B, and S4. ∎

Remark. Alternatively, one can also show that the canonical frame of the consistent normal logic containing 5 must be Euclidean.

Proof.

Let $\mathrm{\Lambda }$ be such a logic. Suppose $u{R}_{\mathrm{\Lambda }}v$ and $u{R}_{\mathrm{\Lambda }}w$. We want to show that $v{R}_{\mathrm{\Lambda }}w$, or ${\mathrm{\Delta }}_v:=\{B\mid \mathrm{\square }B\in v\}\subseteq w$. Let $A$ be any wff. If $A\notin w$, $A\notin {\mathrm{\Delta }}_u$ since $u{R}_{\mathrm{\Lambda }}v$, so $\mathrm{\square }A\notin u$ by the definition of ${\mathrm{\Delta }}_u$, or $\mathrm{\neg }\mathrm{\square }A\in u$ since $u$ is maximal, or $\diamond \mathrm{\neg }A\in u$ by substitution theorem on $\mathrm{\neg }\mathrm{\square }A\leftrightarrow \diamond \mathrm{\neg }A$, or $\mathrm{\square }\diamond \mathrm{\neg }A\in u$ by modus ponens on 5 and the fact that $u$ is closed under modus ponens. This means that $\diamond \mathrm{\neg }A\in {\mathrm{\Delta }}_u$ by the definition of ${\mathrm{\Delta }}_u$, or $\diamond \mathrm{\neg }A\in v$ since $u{R}_{\mathrm{\Lambda }}v$, so that $\mathrm{\neg }\mathrm{\square }A\in v$ by the substitution theorem on $\diamond \mathrm{\neg }A\leftrightarrow \mathrm{\neg }\mathrm{\square }A$, which means $\mathrm{\square }A\notin v$ since $v$ is maximal, or $A\notin {\mathrm{\Delta }}_v$ by the definition of ${\mathrm{\Delta }}_v$. ∎

Title	modal logic S5
Canonical name	ModalLogicS5
Date of creation	2013-03-22 19:34:04
Last modified on	2013-03-22 19:34:04
Owner	CWoo (3771)
Last modified by	CWoo (3771)
Numerical id	11
Author	CWoo (3771)
Entry type	Definition
Classification	msc 03B45
Classification	msc 03B42
Defines	S5
Defines	5
Defines	Euclidean