{"title":"捉迷藏游戏的简单逻辑","authors":"Dazhu Li, Sujata Ghosh, Fenrong Liu, Yaxin Tu","doi":"10.1007/s11225-023-10039-4","DOIUrl":null,"url":null,"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.","PeriodicalId":48979,"journal":{"name":"Studia Logica","volume":"38 4 1","pages":"0"},"PeriodicalIF":0.6000,"publicationDate":"2023-05-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"A Simple Logic of the Hide and Seek Game\",\"authors\":\"Dazhu Li, Sujata Ghosh, Fenrong Liu, Yaxin Tu\",\"doi\":\"10.1007/s11225-023-10039-4\",\"DOIUrl\":null,\"url\":null,\"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.\",\"PeriodicalId\":48979,\"journal\":{\"name\":\"Studia Logica\",\"volume\":\"38 4 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.6000,\"publicationDate\":\"2023-05-17\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Studia Logica\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1007/s11225-023-10039-4\",\"RegionNum\":3,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"LOGIC\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Studia Logica","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1007/s11225-023-10039-4","RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"LOGIC","Score":null,"Total":0}
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.
期刊介绍:
The leading idea of Lvov-Warsaw School of Logic, Philosophy and Mathematics was to investigate philosophical problems by means of rigorous methods of mathematics. Evidence of the great success the School experienced is the fact that it has become generally recognized as Polish Style Logic. Today Polish Style Logic is no longer exclusively a Polish speciality. It is represented by numerous logicians, mathematicians and philosophers from research centers all over the world.