A simple proof of the completeness of APAL
classification
💻 cs.LO
keywords
proofannouncementapalcompletenesssimplearbitraryfoundimprovement
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.