Global Information Lookup Global Information

Accessibility relation information


A simple Kripke model with only three possible worlds, viz. u, v, w. Since the accessibility relation relates w to v and is true at v, the formula is true at w. Since u is not accessible from w, the fact that is true at u does not lead 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 can depend on what's true at another possible world , but only if the accessibility relation relates to . For instance, if holds at some world such that , the formula will be true at . The fact is crucial. If did not relate to , then would be false at unless also held at some other world such that .[1][2]

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 was 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 iff is compatible with the information that's available to the speaker in .

This idea can be extended to different applications of modal logic. In epistemology, one can use an epistemic notion of accessibility where for an individual iff does not know something which would rule out the hypothesis that . In deontic modal logic, one can say that iff is a morally ideal world given the moral standards of . In application of modal logic to computer science, the so-called possible worlds can be understood as representing possible states and the accessibility relation can be understood as a program. Then iff running the program can transition the computer from state to state .

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.

  1. ^ Blackburn, Patrick; de Rijke, Maarten; Venema, Yde (2001). Modal Logic. Cambridge Tracts in Theoretical Computer Science. ISBN 9780521527149.
  2. ^ van Benthem, Johan (2010). Modal Logic for Open Minds (PDF). CSLI. S2CID 62162288. Archived from the original (PDF) on 2020-02-19.

and 26 Related for: Accessibility relation information

Request time (Page generated in 0.8459 seconds.)

Accessibility relation

Last Update:

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...

Word Count : 584

Modal logic

Last Update:

restricting the accessibility relation. For instance, the deontic modal logic D is sound and complete if one requires the accessibility relation to be serial...

Word Count : 8454

Kripke semantics

Last Update:

set, and R is a binary relation on W. Elements of W are called nodes or worlds, and R is known as the accessibility relation. A Kripke model is a triple...

Word Count : 4751

Saul Kripke

Last Update:

set, and R is a binary relation on W. Elements of W are called nodes or worlds, and R is known as the accessibility relation. Depending on the properties...

Word Count : 6506

Web accessibility

Last Update:

Web accessibility, or eAccessibility, is the inclusive practice of ensuring there are no barriers that prevent interaction with, or access to, websites...

Word Count : 7397

Epistemic modal logic

Last Update:

equivalence relation is a binary relation that is reflexive, symmetric, and transitive. The accessibility relation does not have to have these qualities;...

Word Count : 3613

Interior algebra

Last Update:

existential quantification, respectively, without reference to an accessibility relation. The open elements of an interior algebra form a Heyting algebra...

Word Count : 3849

Method of analytic tableaux

Last Update:

each one associated to a truth evaluation; an accessibility relation specifies when a world is accessible from another one. A modal formula may specify...

Word Count : 12511

Dense order

Last Update:

A} does not contain an isolated point Kripke semantics — a dense accessibility relation corresponds to the axiom ◻ ◻ A → ◻ A {\displaystyle \Box \Box A\rightarrow...

Word Count : 744

Amalgamation property

Last Update:

mathematical logic. Examples include in modal logic as an incestual accessibility relation,[clarification needed] and in lambda calculus as a manner of reduction...

Word Count : 776

Intensional logic

Last Update:

one) accessible to world i. The exact semantic content of these assertions therefore depends crucially on the nature of the accessibility relation. For...

Word Count : 1425

Adiabatic accessibility

Last Update:

Adiabatic accessibility denotes a certain relation between two equilibrium states of a thermodynamic system (or of different such systems). The concept...

Word Count : 1191

Glossary of logic

Last Update:

equivalence relation on the type of entities ranged over by α and β. For instance, Hume's principle, and Basic Law V. accessibility relation In modal logic...

Word Count : 29838

Propositional attitude

Last Update:

about their formal properties and their patterns of interaction. Accessibility relation Affect (linguistics) Attitude Belief Disposition Embedded clause...

Word Count : 1083

Counterfactual conditional

Last Update:

accessible worlds where its antecedent holds. Warmbrōd's idea was that speakers will switch to a model with a more permissive accessibility relation in...

Word Count : 5446

Neighborhood semantics

Last Update:

of worlds (or states) and an accessibility relation R intended to indicate which worlds are alternatives to (or, accessible from) others, a neighborhood...

Word Count : 357

Barcan formula

Last Update:

Fx\to \Diamond \exists xFx} . If a frame is based on a symmetric accessibility relation, then the Barcan formula will be valid in the frame if, and only...

Word Count : 447

Modal clausal form

Last Update:

multimodal logic where a represents an agent corresponding to an accessibility relation function in Kripke semantics, a formula in this normal form is a...

Word Count : 414

Field of sets

Last Update:

of a theory in the modal logic S4, the preorder represents the accessibility relation on these possible worlds in this semantics, and the complexes represent...

Word Count : 3670

Deontic logic

Last Update:

underlying logic (which, in the case of SDL, is classical). The accessibility relation between possible world is interpreted as acceptability relations:...

Word Count : 2911

Doxastic logic

Last Update:

believe p {\displaystyle p} "). This corresponds to having a dense accessibility relation in Kripke semantics, and any accurate reasoner is always stable...

Word Count : 1997

Description logic

Last Update:

role-bounded quantifier to a modal operator with that role as its accessibility relation. Operations on roles (such as composition, inversion, etc.) correspond...

Word Count : 4209

Standard translation

Last Update:

refers to the accessibility relation that should be used: normally, ◻ {\displaystyle \Box } and ◊ {\displaystyle \Diamond } refer to a relation R {\displaystyle...

Word Count : 845

Relevance logic

Last Update:

{\displaystyle W} and an accessibility relation ≤ {\displaystyle \leq } on W × W {\displaystyle W\times W} to the frames. The accessibility relation is required to...

Word Count : 3940

Parasocial interaction

Last Update:

least one key attribute from the Internet, in that they offer open accessibility for all users. Philip Drake and Andy Miah argue that the Internet, and...

Word Count : 15863

General frame

Last Update:

particular, the correspondence of modal axioms to properties on the accessibility relation is lost. This can be remedied by imposing additional conditions...

Word Count : 2080

PDF Search Engine © AllGlobal.net