Book contents
- Frontmatter
- Contents
- Preface
- Introduction: What Is Modal Logic?
- 1 The System K: A Foundation for Modal Logic
- 2 Extensions of K
- 3 Basic Concepts of Intensional Semantics
- 4 Trees for K
- 5 The Accessibility Relation
- 6 Trees for Extensions of K
- 7 Converting Trees to Proofs
- 8 Adequacy of Propositional Modal Logics
- 9 Completeness Using Canonical Models
- 10 Axioms and Their Corresponding Conditions on R
- 11 Relations between the Modal Logics
- 12 Systems for Quantified Modal Logic
- 13 Semantics for Quantified Modal Logics
- 14 Trees for Quantified Modal Logic
- 15 The Adequacy of Quantified Modal Logics
- 16 Completeness of Quantified Modal Logics Using Trees
- 17 Completeness Using Canonical Models
- 18 Descriptions
- 19 Lambda Abstraction
- Answers to Selected Exercises
- Bibliography of Works Cited
- Index
5 - The Accessibility Relation
Published online by Cambridge University Press: 09 January 2010
- Frontmatter
- Contents
- Preface
- Introduction: What Is Modal Logic?
- 1 The System K: A Foundation for Modal Logic
- 2 Extensions of K
- 3 Basic Concepts of Intensional Semantics
- 4 Trees for K
- 5 The Accessibility Relation
- 6 Trees for Extensions of K
- 7 Converting Trees to Proofs
- 8 Adequacy of Propositional Modal Logics
- 9 Completeness Using Canonical Models
- 10 Axioms and Their Corresponding Conditions on R
- 11 Relations between the Modal Logics
- 12 Systems for Quantified Modal Logic
- 13 Semantics for Quantified Modal Logics
- 14 Trees for Quantified Modal Logic
- 15 The Adequacy of Quantified Modal Logics
- 16 Completeness of Quantified Modal Logics Using Trees
- 17 Completeness Using Canonical Models
- 18 Descriptions
- 19 Lambda Abstraction
- Answers to Selected Exercises
- Bibliography of Works Cited
- Index
Summary
Chapter 3 introduced the accessibility relation R on the set of worlds W in defining the truth condition for the generic modal operator. In K-models, the frame <W, R> of the model was completely arbitrary. Any nonempty set W and any binary relation R on W counts as a frame for a K-model. However, when we actually apply modal logic to a particular domain and give □ a particular interpretation, the frame <W, R> may take on special properties. Variations in the principles appropriate for a given modal logic will depend on what properties the frame should have. The rest of this chapter explains how various conditions on frames emerge from the different readings we might chose for □.
Conditions Appropriate for Tense Logic
In future tense logic, □ reads ‘it will always be the case that’. Given (□), we have that □A is true at w iff A is true at all worlds v such that wRv. According to the meaning assigned to □, R must be the relation earlier than defined over a set W of times. There are a number of conditions on the frame <W, R> that follow from this interpretation. One fairly obvious feature of earlier than is transitivity.
Transitivity: If wRv and vRu, then wRu.
When wRv (w is earlier than v) and vRu (v is earlier than u), it follows that wRu (w is earlier than u). So let us define a new kind of satisfiability that corresponds to this condition on R.
- Type
- Chapter
- Information
- Modal Logic for Philosophers , pp. 93 - 115Publisher: Cambridge University PressPrint publication year: 2006