2000 character limit reached
A simple proof of the completeness of APAL
Published 9 Sep 2014 in cs.LO | (1409.2612v2)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.
