Many philosophers, following David Lewis, believe that we should look to counterpart theory, not quantified modal logic, as a means of understanding modal discourse. We argue that this is a mistake. Significant parts of modal discourse involve either implicit or explicit reference to what is actually the case, raising the question of how talk about actuality is to be represented counterpart-theoretically. By considering possible modifications of Lewis's counterpart theory, including actual modifications due to Graeme Forbes and Murali Ramachandran, we argue (...) that no coherent version of counterpart theory can provide a plausible representation of talk about actuality, and so, we conclude, counterpart theory should be rejected. (shrink)

The addition of "actually" operators to modal languages allows us to capture important inferential behaviours which cannot be adequately captured in logics formulated in simpler languages. Previous work on modal logics containing "actually" operators has concentrated entirely upon extensions of KT5 and has employed a particular modeltheoretic treatment of them. This paper proves completeness and decidability results for a range of normal and nonnormal but quasi-normal propositional modal logics containing "actually" operators, the weakest of which are conservative extensions of K, (...) using a novel generalisation of the standard semantics. (shrink)

In this note we show that the classical modal technology of Sahlqvist formulas gives quick proofs of the completeness theorems in [8] (D. Gregory, Completeness and decidability results for some propositional modal logics containing "actually" operators, Journal of Philosophical Logic 30(1): 57-78, 2001) and vastly generalizes them. Moreover, as a corollary, interpolation theorems for the logics considered in [8] are obtained. We then compare Gregory's modal language enriched with an "actually" operator with the work of Arthur Prior now known under (...) the name of hybrid logic. This analysis relates the "actually" axioms to standard hybrid axioms, yields the decidability results in [8], and provides a number of complexity results. Finally, we use a bisimulation argument to show that the hybrid language is strictly more expressive than Gregory's language. (shrink)

This paper uses an "admissible set semantics" to treat quantification in quantified modal logics. The truth condition for the universal quantifier states that a universally quantified statement (x)A(x) is true at a world w if and only if there is some proposition true at that world that entails every instance of A(x). It is shown that, for any canonical propositional modal logic the corresponding admissible set semantics characterises the quantified version of that modal logic.

This modern, advanced textbook reviews modal logic, a field which caught the attention of computer scientists in the late 1970's.