modal logic D


The modal logic D (for deontic) is the smallest normal modal logic containing the schema D:

□⁢A→⋄A

A binary relationMathworldPlanetmath R on W is serial if for any w∈W, there is a u∈W such that w⁢R⁢u. In other words, R is first order definable:

∀w⁢∃u⁢(w⁢R⁢u).

The Kripke frames corresponding to D are serial, in the following sense:

Proposition 1.

D is valid in a frame F iff F is serial.

Proof.

First, assume D valid in a frame ℱ:=(W,R), and w∈W. Let M be a model based on ℱ, with V⁢(p)={u∣w⁢R⁢u}. Then ⊧w□⁢p, so that ⊧w⋄p. This means there is a v such that w⁢R⁢v, and hence R is serial.

Conversely, let ℱ be a serial frame, M a model based on ℱ, and w a world in M. Then there is a u such that w⁢R⁢u. Suppose ⊧w□⁢A. Then for all v such that w⁢R⁢v, we have ⊧vA. In particular, ⊧uA. Therefore, ⊧w⋄A, whence ⊧w□⁢A→⋄A. ∎

As a result,

Proposition 2.

D is sound in the class of serial frames.

Proof.

Since any theoremMathworldPlanetmath in D is deducibleMathworldPlanetmath from a finite sequencePlanetmathPlanetmath consisting of tautologiesMathworldPlanetmath, which are valid in any frame, instances of D, which are valid in serial frames by the propositionPlanetmathPlanetmath above, and applications of modus ponensMathworldPlanetmath and necessitation, both of which preserve validity in any frame, whence the result. ∎

In additionPlanetmathPlanetmath, using the canonical model of D, we have

Proposition 3.

D is completePlanetmathPlanetmathPlanetmathPlanetmath in the class of serial frames.

Proof.

We show that the canonical frame ℱ𝐃 is serial. Let w be any maximally consistent set containing D. For any A∈Δw:={B∣□⁢B∈w}, we have □⁢A∈w, so that ⋄A∈w by modus ponens on D. This means that □⁢¬⁢A∉w since w is maximal. As a result, ¬⁢A∉Δw, showing that Δw is consistent, and hence can be enlarged to a maximally consistent set u. As a result, A∈u, whence w⁢R𝐃⁢u. ∎

D is a subsystem of T, for any reflexive relation is serial. As a result, any theorem of D is valid in any serial frame, and therefore in any reflexiveMathworldPlanetmath frame in particular, and as a result a theorem of T by the completeness of T in reflexive frames.

Title modal logic D
Canonical name ModalLogicD
Date of creation 2013-03-22 19:33:54
Last modified on 2013-03-22 19:33:54
Owner CWoo (3771)
Last modified by CWoo (3771)
Numerical id 13
Author CWoo (3771)
Entry type Definition
Classification msc 03B45
Related topic ModalLogicT
Defines D
Defines serial