The undecidability of quantified announcements

DOI10.1007/S11225-016-9657-0zbMATH Open1368.03021OpenAlexW2278173579MaRDI QIDQ310079FDOQ310079

Tim French, Thomas Ågotnes, Hans 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

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

zbMATH Keywords

dynamic epistemic logicarbitrary public announcementscoalition announcementsgroup announcementsundecidability results

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (11)

• The undecidability of arbitrary arrow update logic
• To be announced
• The undecidability of quantified announcements
• Coalition and relativised group announcement logic
• Satisfiability of Arbitrary Public Announcement Logic with Common Knowledge is Σ^1_1-hard
• Positive announcements
• No finite model property for logics of quantified announcements
• Title not available (Why is that?)
• Arbitrary public announcement logic with memory
• Verification and strategy synthesis for coalition announcement logic
• Title not available (Why is that?)

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)