The Monodic Fragment of Propositional Term Modal Logic
- 103 Downloads
We study term modal logics, where modalities can be indexed by variables that can be quantified over. We suggest that these logics are appropriate for reasoning about systems of unboundedly many reasoners and define a notion of bisimulation which preserves propositional fragment of term modal logics. Also we show that the propositional fragment is already undecidable but that its monodic fragment (formulas using only one free variable in the scope of a modality) is decidable, and expressive enough to include interesting assertions.
KeywordsTerm modal logic Bisimulation Decidability Monodic fragment
Unable to display preview. Download preview PDF.
We thank the anonymous reviewers of this journal whose comments have greatly helped to improve the content as well as the presentation. We also thank the reviewers of \(LOFT\ 2016\), and M4M9 for their valuable comments. In an earlier version of this paper, we had erroneously claimed PTML to be decidable, and M4M9 reviewers pointed this out. We thank Varuni Prabhakar for help with the figures.
- 3.Blackburn, P., M. de Rijke, and Y. Venema, Modal Logic (Cambridge Tracts in Theoretical Computer Science), Cambridge University Press, 2001.Google Scholar
- 5.Fitting, M., and R. L. Mendelsohn, First-Order Modal Logic (Synthese Library), Springer, 1999.Google Scholar
- 8.Grove, A. J., and J. Y. Halpern, Naming and identity in a multi-agent epistemic logic, in Proceedings of the 2nd International Conference on Principles of Knowledge Representation and Reasoning (KR’91). Cambridge, MA, USA, April 22–25, 1991, 1991, pp. 301–312.Google Scholar
- 9.Hodkinson, I., F. Wolter, and M. Zakharyaschev, Monodic fragments of first-order temporal logics: 2000–2001 ad, in International Conference on Logic for Programming Artificial Intelligence and Reasoning, Springer, 2001, pp. 1–23.Google Scholar
- 11.Kooi, B., Dynamic term-modal logic, in A Meeting of the Minds, 2007, pp. 173–186.Google Scholar
- 12.Kurucz, A., F. Wolter, M. Zakharyaschev, and D. M. Gabbay, Many-Dimensional Modal Logics: Theory and Applications, vol.148, Gulf Professional Publishing, 2003.Google Scholar
- 13.Padmanabha, A., and R. Ramanujam, Model checking a logic over systems with regular sets of processes, in Developmental Aspects of Intelligent Adaptive Systems (DIAS), vol. 1819, CEUR Workshop Proceedings, 2017.Google Scholar
- 14.Parikh, R., Propositional game logic, in 24th Annual Symposium on Foundations of Computer Science, Tucson, Arizona, USA, 7–9 November 1983, 1983, pp. 195–200.Google Scholar
- 15.Passy, S., and T. Tinchev, Quantifiers in combinatory PDL: completeness, definability, incompleteness, in Fundamentals of Computation Theory, FCT ’85, Cottbus, GDR, September 9–13, 1985, 1985, pp. 512–519.Google Scholar
- 16.Perea, A., Epistemic Game Theory: Reasoning and Choice, Cambridge University Press, 2012.Google Scholar
- 17.Sturm, H., F. Wolter, and M. Zakharyaschev, Monodic epistemic predicate logic, in European Workshop on Logics in Artificial Intelligence, Springer, 2000, pp. 329–344.Google Scholar
- 18.van Benthem, J., Rational dynamics and epistemic logic in games, IGTR 9(1): 13–45, 2007.Google Scholar
- 19.van Ditmarsch, H., W. van der Hoek, and B. Kooi, Dynamic Epistemic Logic: 337 (Synthese Library), Springer, Netherlands, 2007.Google Scholar
- 20.van Emde Boas, P., The convenience of tilings, Lecture Notes in Pure and Applied Mathematics, 1997, pp. 331–363.Google Scholar