Reproduce “Properties of Public Announcements as Operators: Commutativity, Monotonicity, Idempotence, Fixed Points, and Stabilization” on OpenResearch

Turn your favorite coding agents into research agents that review literature, develop hypotheses, and run experiments.

Universal app for Apple silicon and Intel. Requires macOS 11 or later.

About this paper

Eiji Yamada

The authors study repeated public announcements (PAL), which remove states where a claim is false, and believed announcements (BPAL), which instead remove links to false states. They show one formula can have any positive ordinal as its exact stabilization rank, even on S5 models with at least two agents. They also connect common unknowability to extinction under either update process.

Summary by alphaXiv.

Tip: change arxiv.org to autoarxiv.org in any arXiv abstract link to open the paper here.