Normal modal logic
This article is licensed under the GNU Free Documentation License. It uses material from the Wikipedia article "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): from A and AB infer B;
  • Necessitation rule: from A infer \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.

content
Image:Noncont-sym.svg  This logic-related article is a stub. You can help Wikipedia by expanding it.
© jGames.co.uk 2007 (some content from Wikipedia under GDL ) !-- ValueClick Media 468x60 and 728x90 Banner CODE for jgames.co.uk -->
Your Ad Here