Abstract
We propose a new perspective on logics of computation by combining instantial neighborhood logic INL with bisimulation safe operations adapted from PDL and dynamic game logic. INL is a recently proposed modal logic, based on a richer extension of neighborhood semantics which permits both universal and existential quantification over individual neighborhoods. We show that a number of game constructors from game logic can be adapted to this setting to ensure invariance for instantial neighborhood bisimulations, which give the appropriate bisimulation concept for INL. We also prove that our extended logic IPDL is a conservative extension of dual-free game logic, and its semantics generalizes the monotone neighborhood semantics of game logic. Finally, we provide a sound and complete system of axioms for IPDL, and establish its finite model property and decidability.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
We are thankful to Helle Hansen for pointing this out to us.
References
Alur, R., Henzinger, T.A., Kupferman, O.: Alternating-time temporal logic. J. ACM (JACM) 49(5), 672–713 (2002)
van Benthem, J.: Logic in Games. MIT Press, Cambridge (2014)
van Benthem, J., Bezhanishvili, N., Enqvist, S., Yu, J.: Instantial neighborhood logic. Rev. Symbol. Logic 10(1), 116–144 (2017)
Berwanger, D.: Game logic is strong enough for parity games. Stud. Logica 75(2), 205–219 (2003)
Blackburn, P., de Rijke, M., Venema, Y.: Modal Logic. Cambridge Tracts in Theoretical Computer Science. Cambridge University Press, Cambridge (2001)
Carreiro, F., Venema, Y.: PDL inside the \(\mu \)-calculus: a syntactic and an automata-theoretic characterization. Adv. Modal Logic 10, 74–93 (2014)
Dam, M.: CTL* and ECTL* as fragments of the modal \(\mu \)-calculus. Theor. Comput. Sci. 126(1), 77–96 (1994)
Enqvist, S., Seifan, F., Venema, Y.: Completeness for coalgebraic fixpoint logic. In: Proceedings of the 25th EACSL Annual Conference on Computer Science Logic (CSL 2016), LIPIcs, vol. 62, pp. 7:1–7:19 (2016)
Hansen, H.H., Kupke, C.: Weak completeness of coalgebraic dynamic logics. arXiv preprint arXiv:1509.03017 (2015)
Kozen, D.: Results on the propositional \(\mu \)-calculus. Theor. Comput. Sci. 27, 333–354 (1983)
Marti, J., Seifan, F., Venema, Y.: Uniform interpolation for coalgebraic fixpoint logic. In: Proceedings of the Sixth Conference on Algebra and Coalgebra in Computer Science (CALCO 2015), pp. 238–252 (2015)
Marti, J., Venema, Y.: Lax extensions of coalgebra functors. In: Pattinson, D., Schröder, L. (eds.) CMCS 2012. LNCS, vol. 7399, pp. 150–169. Springer, Heidelberg (2012). doi:10.1007/978-3-642-32784-1_9
Parikh, R.: The logic of games and its applications. Ann. Discrete Math. 24, 111–139 (1985)
Reynolds, M.: An axiomatization of full computation tree logic. J. Symbol. Logic 66, 1011–1057 (2001)
van Benthem, J., Ghosh, S., Liu, F.: Modelling simultaneous games in dynamic logic. Synthese 165(2), 247–268 (2008)
Venema, Y.: Automata and fixed point logic: a coalgebraic perspective. Inform. Comput. 204, 637–678 (2006)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer-Verlag GmbH Germany
About this paper
Cite this paper
van Benthem, J., Bezhanishvili, N., Enqvist, S. (2017). A Propositional Dynamic Logic for Instantial Neighborhood Models. In: Baltag, A., Seligman, J., Yamada, T. (eds) Logic, Rationality, and Interaction. LORI 2017. Lecture Notes in Computer Science(), vol 10455. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-55665-8_10
Download citation
DOI: https://doi.org/10.1007/978-3-662-55665-8_10
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-55664-1
Online ISBN: 978-3-662-55665-8
eBook Packages: Computer ScienceComputer Science (R0)
