We show that the actuality operator A is redundant in any propositional modal logic characterized by a class of Kripke models (respectively, neighborhood models). Specifically, we prove that for every formula ${\phi}$ in the propositional modal language with A, there is a formula ${\psi}$ not containing A such that ${\phi}$ and ${\psi}$ are materially equivalent at the actual world in every Kripke model (respectively, neighborhood model). Inspection of the proofs leads to corresponding proof-theoretic results concerning the eliminability of the actuality (...) operator in the actuality extension of any normal propositional modal logic and of any “classical” modal logic. As an application, we provide an alternative proof of a result of Williamson’s to the effect that the compound operator A□ behaves, in any normal logic between T and S5, like the simple necessity operator □ in S5. (shrink)

Epistemic two-dimensional semantics is a theory in the philosophy of language that provides an account of meaning which is sensitive to the distinction between necessity and apriority. While this theory is usually presented in an informal manner, I take some steps in formalizing it in this paper. To do so, I define a semantics for a propositional modal logic with operators for the modalities of necessity, actuality, and apriority that captures the relevant ideas of epistemic two-dimensional semantics. I also describe (...) some properties of the logic that are interesting from a philosophical perspective, and apply it to the so-called nesting problem. (shrink)

‘A logical theory may be tested by its capacity for dealing with puzzles, and it is a wholesome plan, in thinking about logic, to stock the mind with as many puzzles as possible, since these serve much the same purpose as is served by experiments in physical science.’ This paper is an attempt to follow Russell’s advice by using a puzzle about the contingent a priori to test and explore certain theories of reference and modality. No one could claim that (...) the puzzle is of any great philosophical importance by itself, but to understand it, one has to get clear about certain aspects of the theory of reference; and to solve it, one has to think a little more deeply than one is perhaps accustomed about what it means to say that a statement is contingent or necessary. (shrink)

‘A logical theory may be tested by its capacity for dealing with puzzles, and it is a wholesome plan, in thinking about logic, to stock the mind with as many puzzles as possible, since these serve much the same purpose as is served by experiments in physical science.’ This paper is an attempt to follow Russell’s advice by using a puzzle about the contingent a priori to test and explore certain theories of reference and modality. No one could claim that (...) the puzzle is of any great philosophical importance by itself, but to understand it, one has to get clear about certain aspects of the theory of reference; and to solve it, one has to think a little more deeply than one is perhaps accustomed about what it means to say that a statement is contingent or necessary. (shrink)

I review and reconsider some of the themes of ‘Two notions of necessity’ (Davies and Humberstone, 1980) and attempt to reach a deeper understanding and appreciation of Gareth Evans’s reflections (in ‘Reference and contingency’, 1979) on both modality and reference. My aim is to plot the relationships between the notions of necessity that Humberstone and I characterised in terms of operators in two-dimensional modal logic, the notions of superficial and deep necessity that Evans himself described, and the epistemic notion of (...) a priority. (shrink)

Consider two standard quantified modal languages A and P whose vocabularies comprise the identity predicate and the existence predicate, each endowed with a standard S5 Kripke semantics where the models have a distinguished actual world, which differ only in that the quantifiers of A are actualist while those of P are possibilist. Is it possible to enrich these languages in the same manner, in a non-trivial way, so that the two resulting languages are equally expressive-i.e., so that for each sentence (...) of one language there is a sentence of the other language such that given any model, the former sentence is true at the actual world of the model iff the latter is? Forbes (1989) shows that this can be done by adding to both languages a pair of sentential operators called Vlach-operators, and imposing a syntactic restriction on their occurrences in formulas. As Forbes himself recognizes, this restriction is somewhat artificial. The first result I establish in this paper is that one gets sameness of expressivity by introducing infinitely many distinct pairs of indexed Vlach-operators. I then study the effect of adding to our enriched modal languages a rigid actuality operator. Finally, I discuss another means of enriching both languages which makes them expressively equivalent, one that exploits devices introduced in Peacocke (1978). Forbes himself mentions that option but does not prove that the resulting languages are equally expressive. I do, and I also compare the Peacockian and the Vlachian methods. In due course, I introduce an alternative notion of expressivity and I compare the Peacockian and the Vlachian languages in terms of that other notion. (shrink)

Two-dimensional approaches to semantics, broadly understood, recognize two "dimensions" of the meaning or content of linguistic items. On these approaches, expressions and their utterances are associated with two different sorts of semantic values, which play different explanatory roles. Typically, one semantic value is associated with reference and ordinary truth-conditions, while the other is associated with the way that reference and truth-conditions depend on the external world. The second sort of semantic value is often held to play a distinctive role in (...) analyzing matters of cognitive significance and/or context-dependence. (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)