A simple proof of the completeness of APAL
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 a previous paper.
Origin | Files produced by the author(s) |
---|