<?xml version="1.0"?>
<feed xmlns="http://www.w3.org/2005/Atom" xml:lang="en-GB">
	<id>https://www.vigyanwiki.in/api.php?action=feedcontributions&amp;feedformat=atom&amp;user=2A02%3A1812%3A110C%3ADC00%3A7485%3ABAD8%3AF6B3%3A110</id>
	<title>Vigyanwiki - User contributions [en-gb]</title>
	<link rel="self" type="application/atom+xml" href="https://www.vigyanwiki.in/api.php?action=feedcontributions&amp;feedformat=atom&amp;user=2A02%3A1812%3A110C%3ADC00%3A7485%3ABAD8%3AF6B3%3A110"/>
	<link rel="alternate" type="text/html" href="https://www.vigyanwiki.in/wiki/Special:Contributions/2A02:1812:110C:DC00:7485:BAD8:F6B3:110"/>
	<updated>2026-06-12T14:16:26Z</updated>
	<subtitle>User contributions</subtitle>
	<generator>MediaWiki 1.39.3</generator>
	<entry>
		<id>https://www.vigyanwiki.in/index.php?title=Normal_modal_logic&amp;diff=224034</id>
		<title>Normal modal logic</title>
		<link rel="alternate" type="text/html" href="https://www.vigyanwiki.in/index.php?title=Normal_modal_logic&amp;diff=224034"/>
		<updated>2022-10-19T17:10:03Z</updated>

		<summary type="html">&lt;p&gt;2A02:1812:110C:DC00:7485:BAD8:F6B3:110: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;In [[logic]], a '''normal [[modal logic]]''' is a set ''L'' of modal formulas such that ''L'' contains:&lt;br /&gt;
* All propositional [[tautology (logic)|tautologies]];&lt;br /&gt;
* All instances of the [[Saul_Kripke|Kripke]] schema: &amp;lt;math&amp;gt;\Box(A\to B)\to(\Box A\to\Box B)&amp;lt;/math&amp;gt;&lt;br /&gt;
and it is closed under:&lt;br /&gt;
* Detachment rule (''[[modus ponens]]''): &amp;lt;math&amp;gt; A\to B, A \in L&amp;lt;/math&amp;gt; implies &amp;lt;math&amp;gt; B \in L&amp;lt;/math&amp;gt;;&lt;br /&gt;
* Necessitation rule: &amp;lt;math&amp;gt; A \in L&amp;lt;/math&amp;gt; implies &amp;lt;math&amp;gt;\Box A \in L&amp;lt;/math&amp;gt;.&lt;br /&gt;
&lt;br /&gt;
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 (modal logic)|S5]], are normal (and hence are extensions of '''K'''). However a number of [[deontic logic|deontic]] and [[epistemic logic]]s, for example, are non-normal, often because they give up the Kripke schema.&lt;br /&gt;
&lt;br /&gt;
Every normal modal logic is [[regular modal logic|regular]] and hence [[classical modal logic|classical]].&lt;br /&gt;
&lt;br /&gt;
== Common normal modal logics ==&lt;br /&gt;
&amp;lt;onlyinclude&amp;gt;&lt;br /&gt;
The following table lists several common normal modal systems. &amp;lt;/onlyinclude&amp;gt;The notation refers to the table at [[Kripke semantics#Common modal axiom schemata|Kripke semantics § Common modal axiom schemata]]. &amp;lt;onlyinclude&amp;gt;Frame conditions for some of the systems were simplified: the logics are ''sound and complete'' with respect to the frame classes given in the table, but they may ''correspond'' to a larger class of frames.&lt;br /&gt;
&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
! Name !! Axioms !! Frame condition&lt;br /&gt;
|-&lt;br /&gt;
! id=&amp;quot;K&amp;quot; | K&lt;br /&gt;
| —&lt;br /&gt;
| all frames&lt;br /&gt;
|-&lt;br /&gt;
! T&lt;br /&gt;
| T&lt;br /&gt;
| reflexive&lt;br /&gt;
|-&lt;br /&gt;
! K4&lt;br /&gt;
| 4&lt;br /&gt;
| transitive&lt;br /&gt;
|-&lt;br /&gt;
! S4&lt;br /&gt;
| T, 4&lt;br /&gt;
| [[preorder]]&lt;br /&gt;
|-&lt;br /&gt;
! [[S5 (modal logic)|S5]]&lt;br /&gt;
| T, 5 or D, B, 4&lt;br /&gt;
| [[equivalence relation]]&lt;br /&gt;
|-&lt;br /&gt;
! S4.3&lt;br /&gt;
| T, 4, H&lt;br /&gt;
| [[total preorder]]&lt;br /&gt;
|-&lt;br /&gt;
! S4.1&lt;br /&gt;
| T, 4, M&lt;br /&gt;
| preorder, &amp;lt;math&amp;gt;\forall w\,\exists u\,(w\,R\,u\land\forall v\,(u\,R\,v\Rightarrow u=v))&amp;lt;/math&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
! S4.2&lt;br /&gt;
| T, 4, G&lt;br /&gt;
| [[directed set|directed]] preorder&lt;br /&gt;
|-&lt;br /&gt;
! [[provability logic|GL]], K4W&lt;br /&gt;
| GL or 4, GL&lt;br /&gt;
| finite [[strict order|strict partial order]]&lt;br /&gt;
|-&lt;br /&gt;
! Grz, S4Grz&lt;br /&gt;
| Grz or T, 4, Grz&lt;br /&gt;
| finite [[partial order]]&lt;br /&gt;
|-&lt;br /&gt;
! D&lt;br /&gt;
| D&lt;br /&gt;
| [[serial relation|serial]]&lt;br /&gt;
|- &lt;br /&gt;
! D45&lt;br /&gt;
| D, 4, 5&lt;br /&gt;
| transitive, serial, and Euclidean&lt;br /&gt;
|}&amp;lt;/onlyinclude&amp;gt;&lt;br /&gt;
&lt;br /&gt;
==References==&lt;br /&gt;
*Alexander Chagrov and Michael Zakharyaschev, ''Modal Logic'', vol. 35 of Oxford Logic Guides, Oxford University Press, 1997.&lt;br /&gt;
&lt;br /&gt;
{{Logic-stub}}&lt;br /&gt;
&lt;br /&gt;
[[Category:Modal logic]]&lt;/div&gt;</summary>
		<author><name>2A02:1812:110C:DC00:7485:BAD8:F6B3:110</name></author>
	</entry>
</feed>