The undecidability of quantified announcements

DOI10.1007/s11225-016-9657-0zbMath1368.03021OpenAlexW2278173579MaRDI QIDQ310079

Tim French, Thomas Ågotnes, Hans P. van Ditmarsch

Publication date: 7 September 2016

Published in: Studia Logica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11225-016-9657-0

zbMATH Keywords

dynamic epistemic logicarbitrary public announcementscoalition announcementsgroup announcementsundecidability results

Mathematics Subject Classification ID

Logics of knowledge and belief (including belief change) (03B42)

Related Items (10)

The undecidability of quantified announcements ⋮ The undecidability of arbitrary arrow update logic ⋮ To be announced ⋮ Arbitrary public announcement logic with memory ⋮ Satisfiability of Arbitrary Public Announcement Logic with Common Knowledge is Σ^1_1-hard ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Coalition and relativised group announcement logic ⋮ Positive announcements ⋮ Verification and strategy synthesis for coalition announcement logic

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The undecidability of quantified announcements
• A colouring protocol for the generalized Russian cards problem
• Refinement modal logic
• Group announcement logic
• Propositional dynamic logic of regular programs
• Action and knowledge in alternating-time temporal logic
• The undecidability of iterated modal relativization
• Epistemic planning for single- and multi-agent systems
• Quantifying Notes
• The Logic of Public Announcements, Common Knowledge, and Private Suspicions
• Alternating-time temporal logic
• ‘KNOWABLE’ AS ‘KNOWN AFTER AN ANNOUNCEMENT’
• Dynamic Epistemic Logic and Knowledge Puzzles
• A Modal Logic for Coalitional Power in Games
• Arbitrary Action Model Logic and Action Model Synthesis

This page was built for publication: The undecidability of quantified announcements