We introduce Arbitrary Public Announcement Logic with Memory (APALM), obtained by adding to the models a ‘memory’ of the initial states, representing the information before any communication took place (“the prior”), and adding to the syntax operators that can access this memory. We show that APALM is recursively axiomatizable (in contrast to the original Arbitrary Public Announcement Logic, for which the corresponding question is still open). We present a complete recursive axiomatization, that uses a natural finitary rule, we study this logic’s expressivity and the appropriate notion of bisimulation.
CITATION STYLE
Baltag, A., Özgün, A., & Vargas Sandoval, A. L. (2018). APAL with memory is better. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10944 LNCS, pp. 106–129). Springer Verlag. https://doi.org/10.1007/978-3-662-57669-4_6
Mendeley helps you to discover research relevant for your work.