Normal modal logic

In logic, a normal modal logic is a set L of modal formulas such that L contains:

All propositional tautologies;
All instances of the Kripke schema: $\Box (A\to B)\to (\Box A\to \Box B)$

and it is closed under:

Detachment rule (modus ponens): $A\to B,A\vdash B$ ;
Necessitation rule: $\vdash A$ implies $\vdash \Box A$ .

The smallest logic satisfying the above conditions is called K. Most modal logics commonly used nowadays (in terms of having philosophical motivations), e.g. C. I. Lewis's S4 and S5, are extensions of K. However a number of deontic and epistemic logics, for example, are non-normal, often because they give up the Kripke schema.

Every normal modal logic is regular and hence classical.

Common normal modal logics

The following table lists several common normal modal systems. The notation refers to the table at Kripke semantics § Common modal axiom schemata. Frame conditions for some of the systems were simplified: the logics are complete with respect to the frame classes given in the table, but they may correspond to a larger class of frames.

Name	Axioms	Frame condition
K	—	all frames
T	T	reflexive
K4	4	transitive
S4	T, 4	preorder
S5	T, 5 or D, B, 4	equivalence relation
S4.3	T, 4, H	total preorder
S4.1	T, 4, M	preorder, $\forall w\,\exists u\,(w\,R\,u\land \forall v\,(u\,R\,v\Rightarrow u=v))$
S4.2	T, 4, G	directed preorder
GL, K4W	GL or 4, GL	finite strict partial order
Grz, S4Grz	Grz or T, 4, Grz	finite partial order
D	D	serial
D45	D, 4, 5	transitive, serial, and Euclidean

gollark: My main issue with it is:- JS is a wildly unsafe language (in different ways to C, at least) although TS partly fixes this. *Partly*- Hundreds of dependencies needed to do much. I recently interacted with someone on the internet who said this was a *good* thing, and talked about `is-number` being useful. They may be nsane.

gollark: Callbacks have been *mostly* obsoleted by promises, fortunately.

gollark: See, I avoid the hassle of PHP by writing web applications in Node.js, which has fun exciting things like asynchronousness with something like three different ways to write it (events, callbacks, promises, arguably generators), and 1000 dependencies per project.

gollark: PHP Hypertext Preprocessor

gollark: > hears about worse thing> insists on using it

References

Alexander Chagrov and Michael Zakharyaschev, Modal Logic, vol. 35 of Oxford Logic Guides, Oxford University Press, 1997.

This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.