2014/09/10 by Philippe Balbiani, Hans van Ditmarsch
Computer Science · #cs.LO
published as Studies in Logic (ISSN 1674-32-4), volume 8(1), pages 65-78, 2015
arxiv created 2014/09/10 · arxiv updated 2018/02/06
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.