Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
175 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
42 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Satisfiability of Arbitrary Public Announcement Logic with Common Knowledge is $Σ^1_1$-hard (2307.05060v1)

Published 11 Jul 2023 in cs.LO

Abstract: Arbitrary Public Announcement Logic with Common Knowledge (APALC) is an extension of Public Announcement Logic with common knowledge modality and quantifiers over announcements. We show that the satisfiability problem of APALC on S5-models, as well as that of two other related logics with quantification and common knowledge, is $\Sigma1_1$-hard. This implies that neither the validities nor the satisfiable formulas of APALC are recursively enumerable. Which, in turn, implies that APALC is not finitely axiomatisable.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (25)
  1. Journal of Applied Logic 8(1), pp. 62–81, 10.1016/j.jal.2008.12.002.
  2. Thomas Ågotnes & Hans van Ditmarsch (2008): Coalitions and announcements. In Lin Padgham, David C. Parkes, Jörg P. Müller & Simon Parsons, editors: Proceedings of the 7th AAMAS, IFAAMAS, pp. 673–680.
  3. Thomas Ågotnes, Hans van Ditmarsch & Tim French (2016): The undecidability of quantified announcements. Studia Logica 104(4), pp. 597–640, 10.1007/s11225-016-9657-0.
  4. Thomas Ågotnes & Rustam Galimullin (2023): Quantifying over information change with common knowledge. Autonomous Agents and Multi-Agent Systems 37(19), p. 40, 10.1007/s10458-023-09600-1.
  5. Robert J. Aumann (1961): The core of a cooperative game without side payments. Transactions of the American Mathematical Society 98(3), pp. 539–552, 10.2307/1993348.
  6. Review of Symbolic Logic 1(3), pp. 305–334, 10.1017/S1755020308080210.
  7. Philippe Balbiani & Hans van Ditmarsch (2015): A simple proof of the completeness of APAL. Studies in Logic 8(2), pp. 65–78.
  8. Robert L. Berger (1966): The undecidability of the domino problem. Memoirs of the American Mathematical Society, pp. 1–38.
  9. Hans van Ditmarsch (2023): To be announced. Information and Computation 292, pp. 1–42, 10.1016/j.ic.2023.105026.
  10. Hans van Ditmarsch, Wiebe van der Hoek & Barteld Kooi (2008): Dynamic epistemic logic. Synthese Library 337, Springer, 10.1007/978-1-4020-5839-4.
  11. Artificial Intelligence 242, pp. 80–106, 10.1016/j.artint.2016.10.003.
  12. The MIT Press.
  13. Jie Fan (2016): Removing your ignorance by announcing group ignorance: a group announcement logic for ignorance. Studies in Logic 9(4), pp. 4–33.
  14. Tim French & Hans van Ditmarsch (2008): Undecidability for arbitrary public announcement logic. In Carlos Areces & Robert Goldblatt, editors: Proceedings of the 7th AiML, College Publications, pp. 23–42.
  15. Rustam Galimullin (2019): Coalition announcements. Ph.D. thesis, University of Nottingham, UK.
  16. Rustam Galimullin (2021): Coalition and relativised group announcement logic. Journal of Logic, Language and Information 30(3), pp. 451–489, 10.1007/s10849-020-09327-2.
  17. David Harel (1985): Recurring dominoes: making the highly undecidable highly understandable. In Marek Karpinski & Jan van Leeuwen, editors: Topics in the Theory of Computation, North-Holland Mathematics Studies 102, North-Holland, pp. 51–71, 10.1016/S0304-0208(08)73075-5.
  18. Journal of the ACM 33(1), pp. 224–248, 10.1145/4904.4993.
  19. Louwe B. Kuijer (2015): Unsoundness of R𝑅Ritalic_R(□normal-□\square□). Manuscript. Available at https://personal.us.es/hvd/APAL_counterexample.pdf.
  20. Louwe B. Kuijer (2017): Arbitrary arrow update logic with common knowledge is neither RE nor co-RE. In Jérôme Lang, editor: Proceedings of the 16th TARK, EPTCS 251, pp. 373–381, 10.4204/EPTCS.251.27.
  21. John-Jules Ch. Meyer & Wiebe van der Hoek (1995): Epistemic logic for AI and computer science. Cambridge Tracts in Theoretical Computer Science 41, CUP, 10.1017/CBO9780511569852.
  22. Joseph S. Miller & Lawrence S. Moss (2005): The undecidability of iterated modal relativization. Studia Logica 79(3), pp. 373–407, 10.1007/s11225-005-3612-9.
  23. Piergiorgio Odifreddi (1989): Classical recursion theory. Studies in Logic and the Foundations of Mathematics 142, Elsevier.
  24. Marc Pauly (2002): A modal logic for coalitional power in games. Journal of Logic and Computation 12(1), pp. 149–166, 10.1093/logcom/12.1.149.
  25. Jan Plaza (1989): Logics of public communications. In: Proceedings of the 4th ISMIS, Oak Ridge National Laboratory, pp. 201–216.

Summary

We haven't generated a summary for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Summarize Now