A simple proof of the completeness of APAL
Logic in Computer Science
2018-02-06 v2
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.
Keywords
Cite
@article{arxiv.1409.2612,
title = {A simple proof of the completeness of APAL},
author = {Philippe Balbiani and Hans van Ditmarsch},
journal= {arXiv preprint arXiv:1409.2612},
year = {2018}
}