2000 character limit reached
A simple proof of the completeness of APAL (1409.2612v2)
Published 9 Sep 2014 in cs.LO
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.