This dissertation provides a new semantics for first-order modal logic. It is philosophically
motivated by the epistemic reading of modal operators and, in particular, three desiderata in the analysis of epistemic modalities.
(i) The semantic modelling of epistemic modalities, in particular verifiability and falsifiability, cannot be properly achieved by Kripke's relational notion of accessibility. It requires instead a more general, topological notion of accessibility.
(ii) Also, the epistemic reading of modal operators seems to require that we combine modal logic with fully classical first-order logic. For this purpose, however, Kripke's semantics for quantified modal logic is inadequate; its logic is free logic as opposed to classical logic.
(iii) More importantly, Kripke's semantics comes with a restriction that is too strong to let us semantically express, for instance, that the identity of Hesperus and Phosphorus, even if metaphysically necessary, can still be a matter of epistemic discovery.
To provide a semantics that accommodates the three desiderata, I show, on the one hand, how
the desideratum (i) can be achieved with topological semantics, and more generally neighborhood semantics, for propositional modal logic. On the other hand, to achieve (ii) and (iii), it turns out that David Lewis's counterpart theory is helpful at least technically. Even though Lewis's own
formulation is too liberal---in contrast to Kripke's being too restrictive---to achieve our goals, this dissertation provides a unification of the two frameworks, Kripke's and Lewis's. Through a series of both formal and conceptual comparisons of their ontologies and semantic ideas, it is shown that structures called sheaves are needed to unify the ideas and achieve the desiderata (ii) and (iii). In the end, I define a category of sheaves over a neighborhood frame with certain properties, and show that it provides a semantics that naturally unifies neighborhood semantics for propositional modal logic, on the one hand, and semantics for first-order logic on the other. Completeness theorems are proved.
| Identifer | oai:union.ndltd.org:PITT/oai:PITTETD:etd-12082010-214917 |
| Date | 30 January 2011 |
| Creators | Kishida, Kohei |
| Contributors | Robert Brandom, Nuel D. Belnap, Jr., Kenneth Manders, Steve Awodey, Dana Scott |
| Publisher | University of Pittsburgh |
| Source Sets | University of Pittsburgh |
| Language | English |
| Detected Language | English |
| Type | text |
| Format | application/pdf |
| Source | http://etd.library.pitt.edu/ETD/available/etd-12082010-214917/ |
| Rights | restricted, I hereby certify that, if appropriate, I have obtained and attached hereto a written permission statement from the owner(s) of each third party copyrighted matter to be included in my thesis, dissertation, or project report, allowing distribution as specified below. I certify that the version I submitted is the same as that approved by my advisory committee. I hereby grant to University of Pittsburgh or its agents the non-exclusive license to archive and make accessible, under the conditions specified below, my thesis, dissertation, or project report in whole or in part in all forms of media, now or hereafter known. I retain all other ownership rights to the copyright of the thesis, dissertation or project report. I also retain the right to use in future works (such as articles or books) all or part of this thesis, dissertation, or project report. |
Page generated in 0.0017 seconds