PP-2019-14: APAL with Memory is Better

PP-2019-14: Baltag, Alexandru and Özgün, Aybüke and Vargas, Ana Lucia (2019) APAL with Memory is Better. [Pre-print] (Submitted)

There is a more recent version of this item available.
[thumbnail of APALM-Jolli-6.pdf]

Download (294kB) | Preview


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, and study this logic’s expressivity and the appropriate notion of bisimulation. We then examine Group Announcement Logic with Memory, the extension of APALM obtained by adding to its syntax group announcement operators, and provide a complete finitary axiomatization (again in contrast to the original Group Announcement Logic, for which the only known axiomatization is infinitary).

Item Type: Pre-print
Report Nr: PP-2019-14
Series Name: Prepublication (PP) Series
Year: 2019
Uncontrolled Keywords: dynamic epistemic logic, arbitrary public announcement logic, group announcement logic, modal logic, subset space semantics, epistemology
Subjects: Logic
Depositing User: Dr Aybüke Özgün
Date Deposited: 26 May 2019 08:55
Last Modified: 04 Apr 2021 21:31
URI: https://eprints.illc.uva.nl/id/eprint/1681

Available Versions of this Item

Actions (login required)

View Item View Item