Journal of Philosophical Logic 36 (4):473 - 488 (2007)
|Abstract||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|
|Keywords||modality actualism possibilism Vlach-operators|
|Categories||categorize this paper)|
|Through your library||Configure|
Similar books and articles
Ulrich Meyer (2009). 'Now' and 'Then' in Tense Logic. Journal of Philosophical Logic 38 (2):229-247.
Holger Sturm & Frank Wolter (2001). First-Order Expressivity for S5-Models: Modal Vs. Two-Sorted Languages. Journal of Philosophical Logic 30 (6):571-591.
Patrick Blackburn & Jerry Seligman (1995). Hybrid Languages. Journal of Logic, Language and Information 4 (3):251-272.
Dominic Gregory (2001). Completeness and Decidability Results for Some Propositional Modal Logics Containing “Actually” Operators. Journal of Philosophical Logic 30 (1):57-78.
Valentin Goranko (1996). Hierarchies of Modal and Temporal Logics with Reference Pointers. Journal of Logic, Language and Information 5 (1):1-24.
Johan Van Benthem (2006). Modal Frame Correspondences and Fixed-Points. Studia Logica 83 (1-3):133-155.
Johan Van Benthem (2006). Modal Frame Correspondences and Fixed-Points. Studia Logica 83 (1/3):133 - 155.
Katsuhiko Sano & Kentaro Sato (2007). Semantical Characterizations for Irreflexive and Generalized Modal Languages. Notre Dame Journal of Formal Logic 48 (2):205-228.
George Goguadze, Carla Piazza & Yde Venema (2003). Simulating Polyadic Modal Logics by Monadic Ones. Journal of Symbolic Logic 68 (2):419-462.
Yannis Stephanou (2001). Indexed Actuality. Journal of Philosophical Logic 30 (4):355-393.
Added to index2009-01-28
Total downloads12 ( #101,098 of 722,731 )
Recent downloads (6 months)1 ( #60,247 of 722,731 )
How can I increase my downloads?