Jump to content

Normal modal logic

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Sirmob (talk | contribs) at 18:18, 2 October 2006 (disambig link). 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;
  • Kripke's schema: .

Moreover, L is closed under:

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

The modal logic with just the above features is called K. Normal modal logic, a proper extension of the propositional calculus, includes most modal logics commonly used nowadays, including C. I. Lewis's S4 and S5.