Jump to content

Normal modal logic

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Nortexoid (talk | contribs) at 20:56, 20 February 2009 (make clear that mp is a "rule of consequence" and necessitation a "rule of proof". one might wish to express the former as a formula-to-formula rule.). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

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:

and it is closed under:

  • Detachment rule (Modus Ponens): ;
  • Necessitation rule: implies .

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.