Jump to content

Normal modal logic

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by EmilJ (talk | contribs) at 12:25, 19 August 2004 (new page). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

Normal modal logic is a set L of modal formulas such that L contains

  • all propositional tautologies,
  • Kripke's schema: ,

and L is closed under

  • substitution,
  • detachment rule: from A and AB infer B,
  • necessitation rule: from A infer .

The minimal normal modal logic is known as K.