Jump to content

Normal modal logic

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by David Eppstein (talk | contribs) at 07:14, 27 January 2007 (stub sorting). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

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

  • All propositional tautologies;
  • All instances of the Kripke schema:

and it is closed under:

  • Detachment rule: from A and AB infer B;
  • Necessitation rule: from A infer .

The modal logic satisfying exactly the above conditions is the most minimal normal modal logic 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.