modal logic S4


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

  • •

    (T) □⁢A→A, and

  • •

    (4) □⁢A→□⁢□⁢A.

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

Proposition 1.

4 is valid in a frame F iff F is transitiveMathworldPlanetmathPlanetmathPlanetmath.

Proof.

First, suppose ℱ is a frame validating 4, with w⁢R⁢u and u⁢R⁢t. Let M be a model with V⁢(p)={v∣w⁢R⁢v}, where p a propositional variable. So ⊧w□⁢p. By assumptionPlanetmathPlanetmath, we have ⊧w□⁢p→□⁢□⁢p. Then ⊧w□⁢□⁢p. This means ⊧v□⁢p for all v such that w⁢R⁢v. Since w⁢R⁢u, ⊧u□⁢p, which means ⊧sp for all s such that u⁢R⁢s. Since u⁢R⁢t, we have ⊧tp, or t∈V⁢(p), or w⁢R⁢t. Hence R is transitive.

Conversely, let ℱ be a transitive frame, M a model based on ℱ, and w any world in M. Suppose ⊧w□⁢A. We want to show ⊧w□⁢□⁢A, or for all u with w⁢R⁢u, we have ⊧u□⁢A, or for all u with w⁢R⁢u and all t with u⁢R⁢t, we have ⊧tA. If w⁢R⁢u and u⁢R⁢t, w⁢R⁢t since R is transitive. Then ⊧tA by assumption. Therefore, ⊧w□⁢A→□⁢□⁢A. ∎

As a result,

Proposition 2.

S4 is sound in the class of preordered frames.

Proof.

Since any theorem in S4 is deducible from a finite sequencePlanetmathPlanetmath consisting of tautologiesMathworldPlanetmath, which are valid in any frame, instances of T, which are valid in reflexive frames, instances of 4, which are valid in transitive frames by the propositionPlanetmathPlanetmath above, and applications of modus ponensMathworldPlanetmath and necessitation, both of which preserve validity in any frame, whence the result. ∎

In addition, using the canonical model of S4, which is preordered, we have

Proposition 3.

S4 is completePlanetmathPlanetmathPlanetmathPlanetmathPlanetmathPlanetmath in the class of serial frames.

Proof.

Since S4 contains T, its canonical frame ℱ𝐒𝟒 is reflexive. We next show that the canonical frame ℱΛ of any consistentPlanetmathPlanetmath normal logic Λ containing the schema 4 must be transitive. So suppose w⁢RΛ⁢u and u⁢RΛ⁢v. If A∈Δw:={B∣□⁢B∈w}, then □⁢A∈w, or □⁢□⁢A∈w by modus ponens on 4 and the fact that w is closed under modus ponens. Hence □⁢A∈Δw, or □⁢A∈u since w⁢RΛ⁢u, or A∈Δu, or A∈v since u⁢RΛ⁢v. As a result, w⁢RΛ⁢v, and therefore ℱ𝐒𝟒 is a preordered frame. ∎

By a proper translationMathworldPlanetmathPlanetmath, one can map intuitionistic propositional logic PLi into S4, so that a wff of PLi is a theorem iff its translateMathworldPlanetmath is a theorem of S4.

Title modal logic S4
Canonical name ModalLogicS4
Date of creation 2013-03-22 19:34:01
Last modified on 2013-03-22 19:34:01
Owner CWoo (3771)
Last modified by CWoo (3771)
Numerical id 9
Author CWoo (3771)
Entry type Definition
Classification msc 03B42
Classification msc 03B45
Defines S4
Defines 4