Propositional Modal Logic with Implicit Modal Quantification
Propositional term modal logic is interpreted over Kripke structures with unboundedly many accessibility relations and hence the syntax admits variables indexing modalities and quantification over them. This logic is undecidable, and we consider a variable-free propositional bi-modal logic with implicit quantification. Thus \([\forall ]\alpha \) asserts necessity over all accessibility relations and \([\exists ]\alpha \) is classical necessity over some accessibility relation. The logic is associated with a natural bisimulation relation over models and we show that the logic is exactly the bisimulation invariant fragment of a two sorted first order logic. The logic is easily seen to be decidable and admits a complete axiomatization of valid formulas. Moreover the decision procedure extends naturally to the ‘bundled fragment’ of full term modal logic.
KeywordsTerm modal logic Implicitly quantified modal logic Bisimulation invariance Bundled fragment
We thank Yanjing Wang for his insightful and extensive discussions on the theme of this paper. Also, we thank the anonymous reviewers for their comments that helped us improve the presentation and quality of the paper.
- 2.van Benthem, J., et al.: Frame correspondences in modal predicate logic. Proofs, categories and computations: essays in honor of Grigori Mints, pp. 1–14 (2010)Google Scholar
- 12.van der Hoek, W., Pauly, M.: 20 modal logic for games and information. In: Studies in Logic and Practical Reasoning, vol. 3, pp. 1077–1148. Elsevier (2007)Google Scholar
- 15.Kooi, B.: Dynamic term-modal logic. In: A Meeting of the Minds, pp. 173–186 (2007)Google Scholar
- 17.Padmanabha, A., Ramanujam, R.: The monodic fragment of propositional term modal logic. Stud. Logica 1–25 (2018). https://doi.org/10.1007/s11225-018-9784-x
- 18.Padmanabha, A., Ramanujam, R.: Propositional modal logic with implicit modal quantification. arXiv preprint arXiv:1811.09454 (2018)
- 19.Padmanabha, A., Ramanujam, R., Wang, Y.: Bundled fragments of first-order modal logic: (un)decidability. In: 38th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2018, 11–13 December 2018, Ahmedabad, pp. 43:1–43:20 (2018). https://doi.org/10.4230/LIPIcs.FSTTCS.2018.43
- 23.Wang, Y., Seligman, J.: When names are not commonly known: epistemic logic with assignments. In: Advances in Modal Logic, vol. 12, pp. 611–628. College Publications (2018)Google Scholar