Positive Announcements

Hans van Ditmarsch (1) , Tim French (2) , James Hales (2)

1 CELLO - Computational Epistemic Logic in LOrraine
2 UWA - The University of Western Australia

Arbitrary public announcement logic (APAL) reasons about how the knowledge of a set of agents changes after true public announcements and after arbitrary announcements of true epistemic formulas. We consider a variant of arbitrary public announcement logic called positive arbitrary public announcement logic (APAL+), which restricts arbitrary public announcements to announcement of positive formulas. Positive formulas prohibit statements about the ignorance of agents. The positive formulas correspond to the universal fragment in first-order logic. As two successive announcements of positive formulas need not correspond to the announcement of a positive formula, APAL+ is rather different from APAL. We show that APAL+ is more expressive than public announcement logic PAL, and that APAL+ is incomparable with APAL. We also provide a sound and complete infinitary axiomatisation.

Mots clés: Dynamic Epistemic Logic; Multi-agent Systems; Universal Formulas

Domaines: Logique en informatique [cs.LO]; Système multi-agents [cs.MA]

Hans van Ditmarsch, Tim French, James Hales. Positive Announcements. Studia Logica, In press, ⟨10.1007/s11225-020-09922-1⟩. ⟨hal-03014125⟩