Book contents
- Frontmatter
- Contents
- Preface
- Part I Background
- Part II Implication relations
- Part III The logical operators
- Part IV The modal operators
- 25 Introduction
- 26 Modality
- 27 Modals: Existence and nonextensionality
- 28 Special modals
- 29 The possibility of necessity-style modals
- 30 Modals revisited I
- 31 Quantification and modality
- 32 Modals revisited II
- 33 Knowledge, truth, and modality
- 34 The comparative strength of modals
- 35 Kripke-style systematization of the modals without possible worlds
- 36 Model functions, accessibility relations, and theories
- 37 Migrant modals
- Appendix A An implication relation for the integers in the programming language BASIC
- Appendix B Symmetric sequents as products of implication relations and their duals
- Appendix C Component-style logical operators and relevance
- Notes
- Bibliography
- Index
- Frontmatter
- Contents
- Preface
- Part I Background
- Part II Implication relations
- Part III The logical operators
- Part IV The modal operators
- 25 Introduction
- 26 Modality
- 27 Modals: Existence and nonextensionality
- 28 Special modals
- 29 The possibility of necessity-style modals
- 30 Modals revisited I
- 31 Quantification and modality
- 32 Modals revisited II
- 33 Knowledge, truth, and modality
- 34 The comparative strength of modals
- 35 Kripke-style systematization of the modals without possible worlds
- 36 Model functions, accessibility relations, and theories
- 37 Migrant modals
- Appendix A An implication relation for the integers in the programming language BASIC
- Appendix B Symmetric sequents as products of implication relations and their duals
- Appendix C Component-style logical operators and relevance
- Notes
- Bibliography
- Index
Summary
Background
It is part of the lore of logical theory that sooner or later one comes to the study of implication. This study of the modal operators is a consequence of taking the old advice to heart by considering implication sooner rather than later. Modality, on our account, is a way of studying the question whether or not implication continues to be preserved when the elements related by implication are transformed by an operator. The basic idea is that a modal operator is any operator or function φ that transforms or maps the set S of an implication structure I = 〈S, ⇒〉 to itself in such a way that if A1, …, An ⇒ B, then φ(A1), φ(A2), …, φ(An) ⇒ φ(B). There is a second condition concerning the relation of φ to the dual implication relation “⇒̂,” which we shall introduce shortly. The two conditions will then specify the kind of functions that count as having modal character.
If we are correct about this, then the study of modal operators is a natural continuation of the study of implication itself. Whatever reservations a philosopher might have about the philosophical merit of such concepts as “necessity” and “possibility”, there is every reason for studying the modal operators, since they are among the operators that preserve implication. The key idea, then, is to think of a modal operator as modal relative to some implication relation.
- Type
- Chapter
- Information
- A Structuralist Theory of Logic , pp. 239 - 245Publisher: Cambridge University PressPrint publication year: 1992