Satisfiability of Arbitrary Public Announcement Logic with Common Knowledge is Σ^1_1-hard

DOI10.4204/EPTCS.379.21arXiv2307.05060OpenAlexW4383645785MaRDI QIDQ6199614

Louwe B. Kuijer, Rustam Galimullin

Publication date: 28 February 2024

Published in: Electronic Proceedings in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2307.05060

Mathematics Subject Classification ID

Mathematical logic and foundations (03-XX)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The undecidability of quantified announcements
• Arbitrary arrow update logic
• Dynamic epistemic logic
• Group announcement logic
• Classical recursion theory. The theory of functions and sets of natural numbers
• Coalition and relativised group announcement logic
• The undecidability of iterated modal relativization
• The Core of a Cooperative Game Without Side Payments
• Recurring Dominoes: Making the Highly Undecidable Highly Understandable
• ‘KNOWABLE’ AS ‘KNOWN AFTER AN ANNOUNCEMENT’
• A Modal Logic for Coalitional Power in Games
• The undecidability of the domino problem
• To be announced

This page was built for publication: Satisfiability of Arbitrary Public Announcement Logic with Common Knowledge is Σ^1_1-hard