Fully arbitrary public announcements

zbMATH Open1400.03032MaRDI QIDQ4636038FDOQ4636038

Authors: Wiebe van der Hoek, Louwe B. Kuijer, Hans van Ditmarsch 

Publication date: 23 April 2018

Recommendations

• `Knowable' as `known after an announcement'
• How arbitrary are arbitrary public announcements?
• Undecidability for arbitrary public announcement logic
• APAL with memory Ii better
• scientific article; zbMATH DE number 6863640

zbMATH Keywords

dynamic epistemic logicarbitrary public announcementspublic announcements

Mathematics Subject Classification ID

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

Cited In (14)

• Populational announcement logic (PPAL)
• Everything is learnable, once it is settled
• Arbitrary arrow update logic with common knowledge is neither RE nor co-RE
• DYNAMIC CONSEQUENCE AND PUBLIC ANNOUNCEMENT
• Undecidability for arbitrary public announcement logic
• To be announced
• Coalition and relativised group announcement logic
• Putting right the wording and the proof of the truth lemma for \textit{APAL}
• Twelve Angry Men: A Study on the Fine-Grain of Announcements
• APAL with memory Ii better
• Dynamic term-modal logics for first-order epistemic planning
• Arbitrary public announcement logic with memory
• Title not available (Why is that?)
• How arbitrary are arbitrary public announcements?

This page was built for publication: Fully arbitrary public announcements

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