You are here
Home ›normal modal logic
Primary tabs
normal modal logic
The study of modal logic is based on the concept of a logic, which is a set of wff’s satisfying the following:
-
contains all tautologies, and
The last condition means: if and are in , so is in .
A normal modal logic is a modal logic that includes the law of distribution K (after Kripke):
as an axiom schema, and obeying the rule of necessitation :
from , we may infer : if , then .
Normal modal logics are the most widely studied modal logics. The smallest normal modal logic is called K. Other normal modal logics are built from K by attaching wff’s as axiom schemas. Below is a list of schemas used to form some of the most common normal modal logics:
-
4:
-
5:
-
D:
-
T:
-
B:
-
C:
-
M:
-
G:
-
L:
-
W:
For example, the normal modal logic D is the smallest normal modal logic containing as its axiom schema.
Notation. The smallest normal modal logic containing schemas is typically denoted
K.
It is easy to see that K can be built from the “bottom up”: call a finite sequence of wff’s a deduction if each wff is either a tautology, an instance of for some , or as a result of an application of modus ponens or necessitation on earlier wff’s in the sequence. A wff is deducible from if it is the last member of some deduction. Let be the set of all wff’s deducible from deductions of lengths at most . Then
K
Below are some of the most common normal modal logics:
| name | D | T | B | S4 | S5 | GL | K4.3 | S4.3 |
|---|---|---|---|---|---|---|---|---|
| notation | KD | KT | KTB | KT4 | KT5 | KW | K4L | KT4L |
Remarks
-
D is commonly used in the study of deontic logic (logic of obligation). Extensions of D such as KD4 and KD45 are used in the study of doxastic logic (logic of belief).
-
GL is known as provability logic, where means is provable in Peano arithmetic.
-
S4 and S5 are two of the Lewis’ 5 modal logical systems. They are commonly used in the study of epistemic logic (logic of knowledge). The modal logics S1, S2, and S3 are non-normal.
Semantics
The dominant semantics for normal modal logic is the Kripke semantics, or relational semantics. More on this can be found here. A logic is sound in a class of frames if every theorem is valid in every frame in the class, and complete if any formula valid in every frame in the class is a theorem. When a logic is both sound and complete in a class of frames, we say that describes .
The following table lists the logics K and the corresponding sound and complete classes of (Kripke) frames:
| in K | frame K is sound in | frame K is complete in |
|---|---|---|
| 4 | transitive | transitive |
| 5 | Euclidean | Euclidean |
| D | serial | serial |
| T | reflexive | reflexive |
| B | symmetric | symmetric |
| G | weakly directed | weakly directed |
| L | weakly connected | weakly connected |
| W | transitive and converse well-founded | finite transitive and irreflexive |
Mathematics Subject Classification
03B45 Modal logic (including the logic of norms)- Forums
- Planetary Bugs
- HS/Secondary
- University/Tertiary
- Graduate/Advanced
- Industry/Practice
- Research Topics
- LaTeX help
- Math Comptetitions
- Math History
- Math Humor
- PlanetMath Comments
- PlanetMath System Updates and News
- PlanetMath help
- PlanetMath.ORG
- Strategic Communications Development
- The Math Pub
- Testing messages (ignore)
- Other useful stuff
Recent Activity
new correction: typo? by Filipe
May 22
new question: Linear Algebra Combination Problem! by Aleph Zero
new question: Computation of $\varphi(2000)$ by unlord
May 21
new question: pure subgroups by lvoyster
new correction: Typo in M\"obius function? by Aleph Zero
new collection: analytic number theory by Aleph Zero
May 20
new question: Taylor's Series Query! by unlord
new question: Laplace transform by J
new question: Residue Calculus by J
May 19
new Education: Project: PlanetMath Outlines Series by unlord


