Abstract
Many authors have noted that a number of English modal sentences cannot be formalized into standard first-order modal logic. Some widely discussed examples include “There could have been things other than there actually are” and “Everyone who’s actually rich could have been poor.” In response, many authors have introduced an “actually” operator @ into the language of first-order modal logic. It is occasionally noted that some of the example sentences still cannot be formalized with @ if one allows only actualist quantifiers, and embedded versions of these example sentences cannot be formalized even with possibilist quantifiers and @. The typical justification for these claims is to observe that none of the most plausible candidate formalizations succeed. In this paper, we prove these inexpressibility results by using a modular notion of bisimulation for first-order modal logic with “actually” and other operators. In doing so, we will explain in what ways these results do or do not generalize to more expressive modal languages.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
van Benthem, J.F.A.K.: Tense Logic and Standard Logic. Logique et Analyse 80, 395–437 (1997)
van Benthem, J.F.A.K.: Frame Correspondences in Modal Predicate Logic. In: Proofs, Categories and Computations: Essays in Honor of Grigori Mints, pp. 1–14. College Publications, London (2010)
Blackburn, P., de Rijke, M., Venema, Y.: Modal Logic. Cambridge University Press, Cambridge (2001)
Bricker, P.: Quantified Modal Logic and the Plural De Re. Midwest Studies in Philosophy, 372–394 (1989)
Cresswell, M.J.: Entities and Indicies. Kluwer Academic Publishers, Dordrecht (1990)
Crossley, J.N., Humberstone, I.L.: The Logic of “Actually”. Reports on Mathematical Logic 8, 11–29 (1977)
Davies, M., Humberstone, L.: Two Notions of Necessity. Philosophical Studies 38, 1–30 (1980)
Fara, M., Williamson, T.: Counterparts and actuality. Mind 114, 1–30 (2005)
Fine, K.: Model theory for modal logic - Part III Existence and predication. Journal of Philosophical Logic 10, 293–307 (1981)
Garson, J.W.: Handbook of Philosophical Logic, vol. 3, pp. 267–323. Springer (2001)
Hazen, A.P.: Expressive Completeness in Modal Language. Journal of Philosophical Logic 5(1), 25–46 (1976)
Hazen, A.P.: Actuality and Quantification. Notre Dame Journal of Formal Logic 31(4), 498–508 (1990)
Hodes, H.T.: Some Theorems on the Expressive Limitations of Modal Languages. Journal of Philosophical Logic 13(1), 13–26 (1984)
Hodes, H.T.: Axioms of Actuality. Journal of Philosophical Logic 13(1), 27–34 (1984)
Kocurek, A.W.: The Problem of Cross-world Predication (2015) (Manuscript)
Lewis, D.K.: Counterfactuals and Comparative Possibility. Journal of Philosophical Logic 2, 418–446 (1973)
Sider, T.: Logic for Philosophy. Oxford University Press, Oxford (2010)
Sturm, H., Wolter, F.: First-Order Expressivity for S5-Models: Modal vs. Two-Sorted Languages. Journal of Philosophical Logic, 571–591 (July 2001)
Wehmeier, K.F.: World Travelling and Mood Swings. In: Löwe, B., Malzkorn, W., Räsch, T. (eds.) Foundations of the Formal Sciences II (pp, pp. 257–260 (2001)
Yanovich, I.: Expressive Power of “Now” and “Then” Operators. Journal of Logic, Language, and Information 24, 65–93 (2015)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kocurek, A.W. (2015). On the Expressivity of First-Order Modal Logic with “Actually”. In: van der Hoek, W., Holliday, W., Wang, Wf. (eds) Logic, Rationality, and Interaction. LORI 2015. Lecture Notes in Computer Science(), vol 9394. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-48561-3_17
Download citation
DOI: https://doi.org/10.1007/978-3-662-48561-3_17
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-48560-6
Online ISBN: 978-3-662-48561-3
eBook Packages: Computer ScienceComputer Science (R0)