Quantifying over Boolean announcements

MaRDI QIDQ5028475zbMATH OpenFDO

Authors Hans van Ditmarsch, Tim French

Publication date 9 February 2022

Full work available at URL https://arxiv.org/abs/1712.05310, https://lmcs.episciences.org/8991

Mathematics Subject Classification ID

Logic in computer science (03B70) Computer science (68-XX)

Recommendations

• Positive announcements
• `Knowable' as `known after an announcement'
• Expressivity of some versions of APAL
• Fully arbitrary public announcements
• Undecidability for arbitrary public announcement logic

Cites work

• A colouring protocol for the generalized Russian cards problem
• Arbitrary action model logic and action model synthesis
• Arbitrary arrow update logic with common knowledge is neither RE nor co-RE
• Bounds on secret key exchange using a random deal of cards
• Coalition and group announcement logic
• Dynamic epistemic logic
• Epistemic planning for single- and multi-agent systems
• From Situation Calculus to Dynamic Epistemic Logic
• Positive announcements
• Putting right the wording and the proof of the truth lemma for \textit{APAL}
• Reasoning about information change
• The Russian cards problem
• The undecidability of arbitrary arrow update logic
• Undecidability for arbitrary public announcement logic

Cited in

(9)

• Positive announcements
• Arbitrary public announcement logic with memory
• To be announced
• No finite model property for logics of quantified announcements
• A finitary axiomatization of arbitrary social announcement logic
• Arbitrary announcements in social networks: a finitary proof system
• Knowable as knowing how to inquire
• Epistemic skills: logical dynamics of knowing and forgetting
• Epistemic skills: reasoning about knowledge and oblivion

This page was built for publication: Quantifying over Boolean announcements

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