Characterizing Successful Formulas: the Multi-agent Case

TL;DR

This paper advances the understanding of successful formulas in multi-agent Public Announcement Logic by providing a partial characterization of unary operator formulas and discussing approaches for a full solution.

Contribution

It offers the first partial characterization of successful formulas in the multi-agent case and explores methods for achieving a complete characterization.

Findings

Partial characterization of unary operator formulas in multi-agent PAL

Discussion of potential methods for full characterization

Extends understanding from single-agent to multi-agent scenarios

Abstract

Characterization of successful formulas in Public Announcement Logic (PAL) is a well known open problem in Dynamic Epistemic Logic. Recently, Holliday and ICard have given a complete characterization for the single agent case. However, the problem for the multi-agent case is open. This paper gives a partial solution to the problem, characterizing the subclass of the language consisting of unary operators, and discusses methods to give a complete solution.