A simple proof of the completeness of APAL
  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. 
Philippe Balbiani and Hans van Ditmarsch
cs.LO