A simple proof of the completeness of APAL
Philippe Balbiani, Hans van Ditmarsch
TL;DR
This paper presents a straightforward proof demonstrating the completeness of the arbitrary public announcement logic APAL, simplifying previous proofs and enhancing understanding of its foundational properties.
Contribution
It offers a simplified and improved proof of APAL's completeness, advancing theoretical understanding of dynamic epistemic logic.
Findings
Simplified proof of APAL's completeness
Enhanced clarity over previous proofs
Contributes to theoretical foundations of dynamic epistemic logic
Abstract
We provide a simple proof of the completeness of arbitrary public announcement logic APAL. The proof is an improvement over the proof found in the publication Knowable as Known after an Announcement.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsSemantic Web and Ontologies · Logic, programming, and type systems