On the Subtle Nature of a Simple Logic of the Hide and Seek Game

In Alexandra Silva, Renata Wassermann & Ruy de Queiroz (eds.), Logic, Language, Information, and Computation: 27th International Workshop, Wollic 2021, Virtual Event, October 5–8, 2021, Proceedings. Springer Verlag. pp. 201-218 (2021)
  Copy   BIBTEX

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 and we add a new modal variant to that class of logics. We also discuss the relative expressive power of the proposed logic in comparison to the standard modal counterparts.

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 100,497

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Analytics

Added to PP
2022-03-10

Downloads
18 (#1,100,493)

6 months
4 (#1,233,928)

Historical graph of downloads
How can I increase my downloads?

Author Profiles

Fenrong Liu
Tsinghua University
Dazhu Li
Institute of Philosophy, Chinese Academy of Sciences

Citations of this work

A Modal Logic for Supervised Learning.Alexandru Baltag, Dazhu Li & Mina Young Pedersen - 2022 - Journal of Logic, Language and Information 31 (2):213-234.

Add more citations

References found in this work

No references found.

Add more references