← 研踪 PaperTrailarXiv:2611.11911 · v1
Properties of Public Announcements as Operators: Commutativity, Monotonicity, Idempotence, Fixed Points, and Stabilization
首次提交 2026-11-09 13:32
版本更新 2026-11-09 13:32
雷达观测 2026-11-10 13:18
摘要
For each formula , we introduce the public announcement operator , which maps every model to its updated model under the public announcement of . We then study its algebraic and dynamic properties with a particular focus on commutativity, monotonicity, idempotence, fixed points, and stabilization. Among many results, we show the following. First, monotonicity of is characterized by a family of preservation conditions and equivalence to an existential formula. Second, there exists a formula that achieves every nonzero ordinal as a stabilization rank---the first stage at which a model stabilizes---of some model. Finally and unexpectedly, extinction of every model under iterated announcements of is equivalent to common unknowability, being always informative when true, and a fixed point view of the Moore sentence. Over S5, those are further equivalent to common unbelievability and being always informative. Other results include characterizations of commutativity and strong commutativity, idempotence as success, properties of fixed points, and finite and -stabilization. For analysis, we use PAL (state elimination) and BPAL (arrow elimination), clarifying their subtle differences.
作者备注:31 pages, 2 figures, 2 tables
观测到的版本
相邻记录可能跳过中间版本;首次发现 v2 及以上也会标为版本更新。
v1 · 2026-11-09 13:32 · 最新观测版本
Properties of Public Announcements as Operators: Commutativity, Monotonicity, Idempotence, Fixed Points, and Stabilization
For each formula , we introduce the public announcement operator , which maps every model to its updated model under the public announcement of . We then study its algebraic and dynamic properties with a particular focus on commutativity, monotonicity, idempotence, fixed points, and stabilization. Among many results, we show the following. First, monotonicity of is characterized by a family of preservation conditions and equivalence to an existential formula. Second, there exists a formula that achieves every nonzero ordinal as a stabilization rank---the first stage at which a model stabilizes---of some model. Finally and unexpectedly, extinction of every model under iterated announcements of is equivalent to common unknowability, being always informative when true, and a fixed point view of the Moore sentence. Over S5, those are further equivalent to common unbelievability and being always informative. Other results include characterizations of commutativity and strong commutativity, idempotence as success, properties of fixed points, and finite and -stabilization. For analysis, we use PAL (state elimination) and BPAL (arrow elimination), clarifying their subtle differences.
查看此版本解读 →查看此版本原文 ↗