Papers
Topics
Authors
Recent
Search
2000 character limit reached

Positive Announcements

Published 5 Mar 2018 in cs.LO | (1803.01696v4)

Abstract: 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.

Citations (67)

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.