Skip to main content
Log in

A Simple Logic of the Hide and Seek Game

  • Published:
Studia Logica Aims and scope Submit manuscript

Abstract

We discuss a simple logic to describe one of our favourite games from childhood, hide and seek, and show how a simple addition of an equality constant to describe the winning condition of the seeker makes our logic undecidable. There are certain decidable fragments of first-order logic which behave in a similar fashion with respect to such a language extension, and we add a new modal variant to that class. We discuss the relative expressive power of the proposed logic in comparison to the standard modal counterparts. We prove that the model checking problem for the resulting logic is \(\textsf{P}\)-complete. In addition, by exploring the connection with related product logics, we gain more insight towards having a better understanding of the subtleties of the proposed framework.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Areces, C., R. Fervari, and G. Hoffmann, Moving arrows and four model checking results, in L Ong, and R. de Queiroz, (eds.), Proceedings of WoLLIC ’2012, vol. 7456 of LNCS, Springer, 2012, pp. 142–153.

  2. Areces, C., R. Fervari, and G. Hoffmann, Relation-changing modal operators, Logic Journal of the IGPL 23:601–627, 2015.

    Article  Google Scholar 

  3. Areces, C., R. Fervari, G. Hoffmann, and M. Martel, Satisfiability for relation-changing logics, Journal of Logic and Computation 28:1443–1470, 2018.

    Article  Google Scholar 

  4. Aucher, G., J. van Benthem, and D. Grossi, Sabotage modal logic: Some model and proof theoretic aspects, in W. van der Hoek, W.H. Holliday, and W. Wang, (eds.), Proceedings of LORI ’2015, vol. 9394 of LNCS, Springer, 2015, pp. 1–13.

  5. Aucher, G., J. van Benthem, and D. Grossi, Modal logics of sabotage revisited, Journal of Logic and Computation 28(2):269–303, 2018.

    Article  Google Scholar 

  6. Baltag, A., and J. van Benthem, A simple logic of functional dependence, Journal of Philosophical Logic 50:939–1005, 2021.

    Article  Google Scholar 

  7. Baltag, A., D. Li, and M.Y. Pedersen, On the right path: A modal logic for supervised learning, in P. Blackburn, E. Lorini, and M. Guo, (eds.), Proceedings of LORI ’2019, vol. 11813 of LNTCS, Springer, 2019, pp. 1–14.

  8. van Benthem, J., Modal Logic for Open Minds, CSLI Publications, 2010.

  9. van Benthem, J., Logic in Games, The MIT Press, 2014.

  10. van Benthem, J., and F. Liu, Graph games and logic design, in F. Liu, H. Ono, and J. Yu, (eds.), Knowledge, Proof and Dynamics, Springer, 2020, pp. 125–146.

    Google Scholar 

  11. van Benthem, J., An essay on sabotage and obstruction, in D. Hutter, and W. Stephan, (eds.), Mechanizing Mathematical Reasoning, vol. 2605 of LNCS, Springer, 2005, pp. 268–276.

  12. van Benthem, J., L. Li, C. Shi, and H. Yin, Hybrid sabotage modal logic, Journal of Logic and Computation, online first, 2022.

  13. Berger, R., The Undecidability of the Domino Problem, AMS, 1966.

  14. Blackburn, P., M. de Rijke, and Y. Venema, Modal Logic, Cambridge University Press, 2001.

  15. Blackburn, P., and J. Seligman, Hybrid languages, Journal of Logic, Language and Information 4:251–272, 1995.

    Article  Google Scholar 

  16. Blando, F.Z., K. Mierzewski, and C. Areces, The modal logics of the poison game, in F. Liu, H. Ono, and J. Yu, (eds.), Knowledge, Proof and Dynamics, vol. 7 of Logic in Asia: Studia Logica Library, Springer, 2020, pp. 3–23.

  17. Bonato, A., and R.J. Nowakowski, The Game of Cops and Robbers on Graphs, AMS, 2011.

  18. Chen, Q., and D. Li, Logics of the hide and seek game: expressiveness, decidability and axiomatization, manuscript, 2023.

  19. Duchet, P., and H. Meyniel, Kernels in directed graphs: a poison game, Discrete Mathematics 115:273–276 1993.

    Article  Google Scholar 

  20. Gabbay, D., A., Kurucz, F. Wolter, and M. Zakharyaschev, Many-Dimensional Modal Logics: Theory and Applications, Elsevier, 2003.

  21. Gabbay, D., and V. Shehtman: Products of modal logics. Part I, Journal of the IGPL 6:73–146, 1998.

    Article  Google Scholar 

  22. Gabbay, D., and V. Shehtman, Products of modal logics. Part II, Journal of the IGPL 2:165–210, 2000.

    Article  Google Scholar 

  23. Gierasimczuk, N., L. Kurzen, and F.R. Velázquez-Quesada, Learning and teaching as a game: A sabotage approach, in X. He, J. Horty, and E. Pacuit, (eds.), Proceedings of LORI ’2009, vol. 5834 of LNCS, Springer, 2009, pp. 119–132.

  24. Goldfarb, W., The unsolvability of the Gödel class with identity, Journal of Symbolic Logic 49:1237–1252, 1984.

    Article  Google Scholar 

  25. Grossi, D., and S. Rey, Credulous acceptability, poison games and modal logic, in N. Agmon, M.E. Taylor, E. Elkind, and M. Veloso, (eds.), Proceedings of AAMAS 2019, International Foundation for Autonomous Agents and Multiagent Systems, Richland, 2019, pp. 1994–1996.

  26. Hampson, C., S. Kikot’, and A. Kurucz, The decision problem of modal product logics with a diagonal, and faulty counter machines, Studia Logica 104:455–486, 2016.

    Article  Google Scholar 

  27. Kikot’, S.P., Axiomatization of modal logic squares with distinguished diagonal. Mathematical Notes 88:238–250, 2010.

    Article  Google Scholar 

  28. Kurucz, A., Products of modal logics with diagonal constant lacking the finite model property, in S. Ghilardi, and R. Sebastiani, (eds.), Frontiers of Combining Systems, vol. 5749 of LNCS, Springer, 2009, pp. 279–286.

  29. Kurucz, A., Combining modal logics, in P. Blackburn, J. van Benthem, and F. Wolter, (eds.), Handbook of Modal Logic, Studies in Logic and Practical Reasoning, vol. 3, Elsevier, 2007, pp. 869–924.

    Google Scholar 

  30. Li, D., Losing connection: the modal logic of definable link deletion, Journal of Logic and Computation 30:715–743, 2020.

    Article  Google Scholar 

  31. Li, D., S. Ghosh, F. Liu, and Y. Tu, On the subtle nature of a simple logic of the hide and seek game, in A. Silva, R. Wassermann, and R. de Queiroz, (eds.), Proceedings of WoLLIC ’2021, vol. 13038 of LNCS, Springer, 2021, pp. 201–218.

  32. Löding, C., and P. Rohde, Model checking and satisfiability for sabotage modal logic, in P.K. Pandya, and J. Radhakrishnan, (eds.), FSTTCS 2003, vol. 2914 of LNCS, Springer, 2003, pp. 302–313.

  33. Marx, M., and Y. Venema, Multi-Dimensional Modal Logic, Kluwer Academic Publishers, 1997.

    Google Scholar 

  34. Nowakowski, R., and R.P. Winkler, Vertex-to-vertex pursuit in a graph, Discrete Mathematics 13:235–239, 1983.

    Google Scholar 

  35. Pützstück, P., Decidability and Bisimulation for Logics of Functional Dependence, Bachelor’s thesis, Mathematical Foundations of Computer Science, RWTH-Aachen University, 2020.

  36. Rohde, P., On games and logics over dynamically changing structure, Ph.D. thesis, RWTH Aachen University, 2005.

  37. Sano, K., Axiomatizing hybrid products: How can we reason many-dimensionally in hybrid logic?, Journal of Applied Logic 8:459–474, 2010.

    Article  Google Scholar 

  38. Thompson, D., Local fact change logic, in F. Liu, H. Ono, and J. Yu, (eds.), Knowledge, Proof and Dynamics, vol. 7 of Logic in Asia: Studia Logica Library, Springer, 2020, pp. 73–96.

  39. Tu, Y., S. Ghosh, D. Li, and F. Liu, Modal substitution logic, manuscript, 2023.

  40. Vardi, M., On the complexity of bounded-variable queries, in Proceedings of the ACM 14th Symposium on Principles of Database Systems, 1995, pp. 266–276.

Download references

Acknowledgements

We thank Johan van Benthem for his inspiring suggestions. We wish to thank the anonymous reviewers for their helpful comments for improvements. Sujata Ghosh acknowledges Department of Science and Technology, Government of India for financial support vide Reference No DST/CSRI/2018/202 under Cognitive Science Research Initiative (CSRI) to carry out this work. Dazhu Li is supported by the National Social Science Foundation of China [22CZX063], Fenrong Liu and Yaxin Tu are supported by Tsinghua University Initiative Scientific Research Program.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Sujata Ghosh.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Presented by Yde Venema

Rights and permissions

Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Li, D., Ghosh, S., Liu, F. et al. A Simple Logic of the Hide and Seek Game. Stud Logica 111, 821–853 (2023). https://doi.org/10.1007/s11225-023-10039-4

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11225-023-10039-4

Keywords

Navigation