The undecidability of quantified announcements

DOI10.1007/S11225-016-9657-0MaRDI QIDQ310079zbMATHOpenAlexFDO

Authors Thomas Ågotnes, Hans van Ditmarsch, Tim French

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)

Recommendations

• Undecidability for arbitrary public announcement logic
• Group announcement logic
• Coalition and relativised group announcement logic
• `Knowable' as `known after an announcement'
• Logics with group announcements and distributed knowledge: completeness and expressive power

Cites work

• scientific article; zbMATH DE number 1028833 (Why is no real title available?)
• scientific article; zbMATH DE number 795590 (Why is no real title available?)
• scientific article; zbMATH DE number 5064947 (Why is no real title available?)
• A Modal Logic for Coalitional Power in Games
• A colouring protocol for the generalized Russian cards problem
• Action and knowledge in alternating-time temporal logic
• Alternating-time temporal logic
• Arbitrary action model logic and action model synthesis
• Dynamic Epistemic Logic and Knowledge Puzzles
• Epistemic planning for single- and multi-agent systems
• Future event logic -- axioms and complexity
• Group announcement logic
• Logic in games
• Propositional dynamic logic of regular programs
• Quantifying Notes
• Refinement modal logic
• The logic of public announcements, common knowledge, and private suspicions
• The undecidability of iterated modal relativization
• The undecidability of quantified announcements
• Undecidability for arbitrary public announcement logic
• `Knowable' as `known after an announcement'

Cited in

(12)

• To be announced
• Coalition and relativised group announcement logic
• Arbitrary public announcement logic with memory
• Undecidability for arbitrary public announcement logic
• The undecidability of quantified announcements
• Verification and strategy synthesis for coalition announcement logic
• Satisfiability of Arbitrary Public Announcement Logic with Common Knowledge is Σ^1_1-hard
• No finite model property for logics of quantified announcements
• Arbitrary arrow update logic with common knowledge is neither RE nor co-RE
• The undecidability of arbitrary arrow update logic
• Coalition and group announcement logic
• Positive announcements

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q310079)