A simple proof of the completeness of APAL
Résumé
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.
Origine | Fichiers produits par l'(les) auteur(s) |
---|