Math 2.0

Proposition

Common modal axiom schemata

Statement

The following table lists common modal axioms together with their corresponding classes. The naming of the axioms often varies; Here, axiom K is named after Saul Kripke; axiom T is named after the truth axiom in epistemic logic; axiom D is named after deontic logic; axiom B is named after L. E. J. Brouwer; and axioms 4 and 5 are named based on C. I. Lewis's numbering of symbolic logic systems.

Axiom K can also be rewritten as □[(A→B)∧A]→□B\Box [(A\to B)\land A]\to \Box B, which logically establishes modus ponens as a rule of inference in every possible world.

Note that for axiom D, ◊A\Diamond A implicitly implies ◊⊤\Diamond\top, which means that for every possible world in the model, there is always at least one possible world accessible from it (which could be itself). This implicit implication ◊A→◊⊤\Diamond A \rightarrow \Diamond\top is similar to the implicit implication by existential quantifier on the range of quantification.

Further reading

  1. Wikipedia, page 911960, revision 1374082003, Kripke semantics, section Semantics of modal logic > Correspondence and completeness > Common modal axiom schemata. adopted
About this page
TagFDFQFWPM4X
URIm2://FDFQFWPM4X
Kindstatement, proposition
WritingW0 stub
StatusThis copy of the site has no build data. Run m2 status FDFQFWPM4X.
Changed4 November 2026

Markdown · JSON · Edit on GitHub

What this page needs for W1

  • edge uses out: each definition that the statement needs (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

What links here

No page links to this page yet.