In modal logic, an accessibility relation is a binary relation, written as between possible worlds.
Read more about Accessibility Relation: Description of Terms, Basic Review of (Propositional) Modal Logic, The Four Types of The 'Accessibility Relation' in Formal Semantics, Comment About The 'Accessibility Relation', Philosophical Applications, Computer Science Applications
Other articles related to "accessibility relation, relation":
... of Kripke frames and is a mapping such that f preserves the accessibility relation, i.e ... a bisimulation between frames and is a relation B ⊆ W × W’, which satisfies the following “zig-zag” property if u B u’ and u R v, there exists v’ ∈ W ... The definition of the accessibility relation R’ varies in the simplest case we put , but many applications need the reflexive and/or transitive closure of this relation, or similar modifications ...
... Either choice defines a particular 'accessibility relation' giving rise to a particular modal logic suited specifically for theorems about the computation ...
... are generally called possible worlds, and a binary relation, R, that holds (or not) between the possible worlds of G ... This binary relation is called the accessibility relation ... We do so by defining a relation ⊨ between possible worlds and propositional letters ...
Famous quotes containing the word relation:
“In relation to God, we are like a thief who has burgled the house of a kindly householder and been allowed to keep some of the gold. From the point of view of the lawful owner this gold is a gift; From the point of view of the burglar it is a theft. He must go and give it back. It is the same with our existence. We have stolen a little of God’s being to make it ours. God has made us a gift of it. But we have stolen it. We must return it.”
—Simone Weil (1909–1943)