accessibility relation

{{Short description|Modal logic relationship}}

{{more footnotes|date=July 2020}}

File:Simple kripke model.png with only three possible worlds, viz. $u$, $v$, $w$. Since the accessibility relation relates $w$ to $v$ and $P$ is true at $v$, the formula $\backslash Diamond\; P$ is true at $w$. Since $u$ is not accessible from $w$, the fact that $Q$ is true at $u$ does not lead $\backslash Diamond\; Q$ to be true at $w$.]]

An accessibility relation is a relation which plays a key role in assigning truth values to sentences in the relational semantics for modal logic. In relational semantics, a modal formula's truth value at a possible world $w$ can depend on what is true at another possible world $v$, but only if the accessibility relation $R$ relates $w$ to $v$. For instance, if $P$ holds at some world $v$ such that $wRv$, the formula $\backslash Diamond\; P$ will be true at $w$. The fact $wRv$ is crucial. If $R$ did not relate $w$ to $v$, then $\backslash Diamond\; P$ would be false at $w$ unless $P$ also held at some other world $u$ such that $wRu$.{{cite book |last1= Blackburn |first= Patrick |last2= de Rijke |first2= Maarten |last3= Venema|first3= Yde |date=2001 |title= Modal Logic |url=https://books.google.com/books?id=pbb_Asgoq0oC&dq=rijlke%20blackburn%20venema%20modal%20logic&pg=PP1 |publisher=Cambridge Tracts in Theoretical Computer Science|isbn= 9780521527149 }}{{cite book |last= van Benthem |first= Johan |date=2010 |title= Modal Logic for Open Minds |url= https://pdfs.semanticscholar.org/9bea/866c143326aeb700c20165a933f583b16a46.pdf |archive-url= https://web.archive.org/web/20200219165057/https://pdfs.semanticscholar.org/9bea/866c143326aeb700c20165a933f583b16a46.pdf |url-status= dead |archive-date= 2020-02-19 |publisher= CSLI|s2cid= 62162288 }}

Accessibility relations are motivated conceptually by the fact that natural language modal statements depend on some, but not all, alternative scenarios. For instance, the sentence "It might be raining" is not generally judged true simply because one can imagine a scenario where it is raining. Rather, its truth depends on whether such a scenario is ruled out by available information. This fact can be formalized in modal logic by choosing an accessibility relation such that $wRv$ if $v$ is compatible with the information that is available to the speaker in $w$.

This idea can be extended to various applications of modal logic. In epistemic logic, one can use an epistemic notion of accessibility where $wRv$ for an individual $I$ if $I$ does not know something which would rule out the hypothesis that $w\text{'}=v$. In deontic logic, one can say that $wRv$ if $v$ is a morally ideal world given the moral standards of $w$. In the application of modal logic to computer science, possible worlds can be understood as representing possible states of a system and the accessibility relation can be understood as representing state transitions (see Kripke structure (model checking)). Then $wRv$ if the system can transition from state $w$ to state $v$.

Different applications of modal logic can suggest different restrictions on admissible accessibility relations, which can in turn lead to different validities. The mathematical study of how validities are tied to conditions on accessibility relations is known as modal correspondence theory.