Modal_logic

A modal logic was originally designed to describe the logical relations of modal notions. The list of the notions includes metaphysical modalities (necessities, possibilities, etc.), epistemic modalities (knowledge, belief, etc.), temporal modalities (future, past, etc.), and deontic modalities (obligation, permission, etc.). Because of the importance of these modal notions, modal logics have attracted many areas in philosophy, including metaphysics and epistemology. However, the interests in modal logics are not limited to such philosophical investigations. Because of its wide applicability, the general framework of modal logic have been used in various areas such as artificial intelligence, database theory, and game theory.

Contents

1 Basic Ideas
2 Standard Syntax and Semantics of Modal Logics

2.1 Syntax
2.2 Kripke Semantics


3 Axiomatic Systems and Frame Correspondence
4 Some Applications
5 A Brief Historical Note on Modal Logic
6 References
7 External links

7.1 General Philosophy Sources


8 Acknowledgements
9 Credits



The languages of modal logics usually extend preexisting logics, e.g propositional logic, first-order logic with modal operators, which are often symbolized as boxes 



◻


{\displaystyle \Box }

 and diamonds 



◊


{\displaystyle \Diamond }

. Semantic structures for the languages of modal logics are relational structures and the modal languages can be characterized as describing various properties of the relational structures.

Basic Ideas
One major notion that has been considered in modal logics is metaphysical modality. Examples of the modal notion are necessity and possibility. The modal logic that describe the logical relations of statements such as “It is necessary that 2+2=4,” “It is possible that Bigfoot exists” etc. is called alethic modal logic. The main idea of analyzing such modal statements was produced based on the metaphysical view that is usually credited to Leibniz. The idea is to analyze the statement of the form “It is necessary that p” as “In all possible worlds, p is the case,” and “It is possible that p” as “There is some possible world in which p is the case.” In other words, necessity is analyzed as the truth in all possible worlds, and possibility, as the truth in some possible world.
Based on this idea, alethic modal logic clarifies the logical relations of modal statements of the kind in question. For instance, one basic equivalence in alethic modal logic, the one between “It is necessary that p” and “It is not possible that not-p,” is explicated as the equivalence between “In all possible worlds, p is the case” and “There is no possible world in which p is not the case.” Alethic modal logic enables one to see more complex relations of the metaphysical modal statements.
This general idea is modeled in what is called Kripke semantics by relational structures (see below). Because of the wide applicability of the general framework, modal logics have been used, beyond the formalization of metaphysical modality, to represent modal concepts and phenomena. Depending on the purposes of applications, modal logics get specific names. Epistemic logic is designed to describe epistemic notions such as knowledge and belief; temporal logic, temporal structures; deontic logic, deontic notions such as obligation and permission; dynamic logic, actions of computer programs, etc.

Standard Syntax and Semantics of Modal Logics
Syntax
The languages of modal logics extend preexisting logical languages with modal operators—most standard boxes 



◻


{\displaystyle \Box }

 and diamonds 



◊


{\displaystyle \Diamond }

. The intended meanings of boxes and diamonds, say, in alethic modal logic, are respectively “It is necessary that...” and “It is possible that....”
The language of propositional modal logic—the extension of propositional logic with modal operators—consists of propositional variables (p, q, r, …), Boolean connectives (



¬


{\displaystyle \lnot }

, 



∧


{\displaystyle \wedge }

, 



∨


{\displaystyle \vee }

, 



→


{\displaystyle \rightarrow }

), and modal operators (



◻


{\displaystyle \Box }

 and 



◊


{\displaystyle \Diamond }

). In a standard way, the sentences of propositional modal logic is recursively defined as follows:





ϕ


{\displaystyle \phi }

 := p (with p a propositional variable) | 



ϕ
∧
ψ


{\displaystyle \phi \wedge \psi }

 | 



¬
ϕ


{\displaystyle \lnot \phi }

 | 



◊
ϕ


{\displaystyle \Diamond \phi }


The other Boolean connectives are defined as usual (for instance, "



ϕ
∨
ψ


{\displaystyle \phi \vee \psi }

" is defined as "



¬
(
¬
ϕ
∧
¬
ψ
)


{\displaystyle \lnot (\lnot \phi \wedge \lnot \psi )}

" and "



ϕ
→
ψ


{\displaystyle \phi \rightarrow \psi }

," as "



¬
ϕ
∨
ψ


{\displaystyle \lnot \phi \vee \psi }

"), and, based on the observation about the above basic equivalence, “



◻
ϕ


{\displaystyle \Box \phi }

” is defined as the abbreviation of “



¬
◊
¬
ϕ


{\displaystyle \lnot \Diamond \lnot \phi }

.”
Other than the language of modal propositional logic, there are various versions of extensions of preexisting languages. Extensions with modal operators are considered for other preexisting languages. For instance, the extension of first-order logic, called modal predicate logic, has been widely considered. Also, extensions are given with modality operators with multiple arities, i.e. modal operators that are followed by a multiple number of formulas rather than by just a single formula as is the case of the propositional modal logic presented above.

Kripke Semantics
The standard semantics of modal languages is Kripke semantics, which is given by relational models. The Kripke semantics of propositional modal logic can be presented as follows. A frame is a tuple (W, R), where W is an non-empty set and R is a two-place relation on W. W can be thought of as a set of possible world, and R, the accessibility relation between worlds, which represents the possible worlds that are considered at a given world, i.e. if we are at a world 




w

0




{\displaystyle w_{0}}

, every possible world v such that 



R

w

0


v


{\displaystyle Rw_{0}v}

 represents the possibility that are considered at a world 




w

0




{\displaystyle w_{0}}

. Given a frame (W, R), a model is a tuple (W, R, V) where V is a map that assigns to a world a valuation function on propositional variables, i.e. for a given world w, V(w) is a function from the set of propositional variables to {0, 1} where 0 and 1 represents the truth-values, False and True. Truth of formulas is defined with respect to a model M and a world w as follows:
(



M
,
w
⊨
ϕ


{\displaystyle M,w\models \phi }

 reads as “



ϕ


{\displaystyle \phi }

 is true at a world 



ϕ


{\displaystyle \phi }

 in a model M.)





M
,
w
⊨
p


{\displaystyle M,w\models p}

 iff V(w)(p)=1 (with p a propositional variable)




M
,
w
⊨
ϕ
∧
ψ


{\displaystyle M,w\models \phi \wedge \psi }

 iff 
 


M
,
w
⊨
ϕ


{\displaystyle M,w\models \phi }

 and 



M
,
w
⊨
ψ


{\displaystyle M,w\models \psi }

.




M
,
w
⊨
¬
ϕ


{\displaystyle M,w\models \lnot \phi }

 iff 



M
,
w
"C.E.;
ϕ


{\displaystyle M,w\not \models \phi }

.




M
,
w
⊨
◻
ϕ


{\displaystyle M,w\models \Box \phi }

 iff, for every world 




w

′




{\displaystyle w^{\prime }}

 such that 



R
w

w

′




{\displaystyle Rww^{\prime }}

, 



M
,
w
⊨
ϕ


{\displaystyle M,w\models \phi }

.
The last clause captures the main idea of Leibnizian conception of necessary truth as truth in all possibilities in such a way that “It is necessary that 



ϕ


{\displaystyle \phi }

” is true at a world w in a model M if and only if 



ϕ


{\displaystyle \phi }

 is true in all possible worlds accessible from a world w.
A sentence is valid in a model M if it is true at every possible world in M. A sentence is valid in a frame F if it is valid in every model based on F. A sentence is valid if it is valid in all frames (or every model).
By extending this model-theoretic framework, the semantics for other modal languages are given. In modal predicate logic, a model is designed so that a domain of quantification is associated with each possible world, and in modal logics with modal operator with multiple arities, the accessibility relations of appropriate arities on possible worlds are taken.

Axiomatic Systems and Frame Correspondence
The Kripke semantics presented here has a sound and complete axiomatic system, i.e. the system in which, for a sentence 



ϕ


{\displaystyle \phi }

, 



ϕ


{\displaystyle \phi }

 is valid if and only if 



ϕ


{\displaystyle \phi }

 is provable. The system is called K. K is the system obtained by adding the following two principles to propositional logic:
Necessitation Rule: If A is a theorem, 



◻
A


{\displaystyle \Box A}

 is a theorem.
K: 



◻
(
ϕ
→
ψ
)
→
(
◻
ϕ
→
◻
ψ
)


{\displaystyle \Box (\phi \rightarrow \psi )\rightarrow (\Box \phi \rightarrow \Box \psi )}


Various systems are obtained by adding extra axioms to K. Some of the most famous axioms are:
T: 



◻
ϕ
→
ϕ


{\displaystyle \Box \phi \rightarrow \phi }


S4: 



◻
ϕ
→
◻
◻
ϕ


{\displaystyle \Box \phi \rightarrow \Box \Box \phi }


S5: 



◊
ϕ
→
◻
◊
ϕ


{\displaystyle \Diamond \phi \rightarrow \Box \Diamond \phi }


The system T is obtained by adding the axiom scheme T to K. T is sound and complete with respect to the set of models that are based on reflexive frames (i.e. frames (W, R) such that, for all x in W, Rxx). The addition of S4 to T yields the system S4. S4 is sound and complete with respect to reflexive and transitive frames (Transitive frames are frames (W, R) such that, for all x, y, z in W, if Rxy and Ryz, then Rxz). Finally, the addition of S5 to S4 yields the system S5, which is sound and complete with respect to reflexive, transitive and symmetric frames, (symmetric frames are frames (W, R) such that, for every x, y in W, if Rxy, then Ryx.

Some Applications
Modal logics have been applied to capture various kinds of concepts and phenomena. Depending on the subject matter, modal operators are interpreted in different ways. Here are some of the major examples:
Epistemic Logic: Boxes are written as “K” or “B.” “K



ϕ


{\displaystyle \phi }

” is interpreted as “It is known that 



ϕ


{\displaystyle \phi }

,” and “B



ϕ


{\displaystyle \phi }

,” as “It is believed that 



ϕ


{\displaystyle \phi }

.”
Deontic Logic: Boxes and diamonds are written as “O” and “P” respectively. “O



ϕ


{\displaystyle \phi }

” is interpreted as “It is obligatory that 



ϕ


{\displaystyle \phi }

,” and “P



ϕ


{\displaystyle \phi }

,” as “It is permitted that 



ϕ


{\displaystyle \phi }

.”
Temporal Logic: Boxes are written as “G” for the future and “H” for the past. “G



ϕ


{\displaystyle \phi }

” means "



ϕ


{\displaystyle \phi }

 will be always the case” and “H



ϕ


{\displaystyle \phi }

,” “



ϕ


{\displaystyle \phi }

 was always the case.” The corresponding diamonds are written as “F” and “P” respectively. “F



ϕ


{\displaystyle \phi }

” and “P



ϕ


{\displaystyle \phi }

” mean “It will be the case that 



ϕ


{\displaystyle \phi }

” and
“It was the case that 



ϕ


{\displaystyle \phi }

.”
Depending on the interpretations of modalities, different axiomatic constraints are placed on modal operators. For instance, in epistemic logic, it is appropriate to accept the T axiom, since the knowledge that 



ϕ


{\displaystyle \phi }

 implies that 



ϕ


{\displaystyle \phi }

 is true; however, in deontic logic, T might not be appropriate, since 



ϕ


{\displaystyle \phi }

 might not be the case even if it is obligatory that 



ϕ


{\displaystyle \phi }

. There have been wide ranges of discussions about what axioms are appropriate for each modal notions.

A Brief Historical Note on Modal Logic
Although Aristotle's logic is almost entirely concerned with the theory of the categorical syllogism, his work also contains some extended arguments on points of modal logic (such as his famous Sea-Battle Argument in De Interpretatione § 9) and their connection with potentialities and with time. Following on his works, the Scholastics developed the groundwork for a rigorous theory of modal logic, mostly within the context of commentary on the logic of statements about essence and accident. Among the medieval writers, some of the most important works on modal logic can be found in the works of William of Ockham and John Duns Scotus.
The start of formal modal logics is usually associated with the work by C. I. Lewis, who introduced a system (later called S3) in his monograph A Survey of Symbolic Logic (1918) and (with C. H. Langford) the systems S1-S5 in the book Symbolic Logic (1932). The first formalization of deontic logic was by E. Mally in 1920s. Epistemic logic was initiated by G. H. von Wright and further developed by J. Hintikka in 50s and 60s. Temporal logic was developed by A. N. Prior in 1960s. The relational semantics for modal logic was developed in the works by J. Hintikka, Kanger, and Kripke in late 50s and early 60s.

ReferencesISBN links support NWE through referral fees
P. Blackburn, M. de Rijke, and Y. Venema. Modal Logic. Cambridge University Press, 2001.
Hughes, G.E. and M.J. Cresswell. An Introduction to Modal Logic. Methuen, 1968.
Hughes, G.E. and M.J. Cresswell. A Companion to Modal Logic. Medhuen, 1984.
Hughes, G.E. and M.J. Cresswell. A New Introduction to Modal Logic. Routledge, 1996.
External links
All links retrieved November 9, 2022.

Modal logic, Stanford Encyclopedia of Philosophy
A discussion of modal logic by John McCarthy
Advances in Modal Logic Bi-annual international conference and book series in Modal Logic.
General Philosophy Sources
Stanford Encyclopedia of Philosophy
The Internet Encyclopedia of Philosophy
Paideia Project Online
Project Gutenberg
Acknowledgements
This article contains some material originally from the Free On-line Dictionary of Computing which is used with permission under the GFDL.


Credits
New World Encyclopedia writers and editors rewrote and completed the Wikipedia article
in accordance with New World Encyclopedia standards. This article abides by terms of the Creative Commons CC-by-sa 3.0 License (CC-by-sa), which may be used and disseminated with proper attribution. Credit is due under the terms of this license that can reference both the New World Encyclopedia contributors and the selfless volunteer contributors of the Wikimedia Foundation. To cite this article click here for a list of acceptable citing formats.The history of earlier contributions by wikipedians is accessible to researchers here:

Modal logic  history
The history of this article since it was imported to New World Encyclopedia:

History of "Modal logic"
Note: Some restrictions may apply to use of individual images which are separately licensed.