跳到正文
研踪PaperTrail
← 研踪 PaperTrail

arXiv:2611.21157 · v1

Going Deep Inside Public Announcement Logic

首次提交 2026-11-16 22:22
版本更新 2026-11-16 22:22
雷达观测 2026-11-17 17:11
arXiv ↗PDF ↗

摘要

Dynamic Epistemic Logic (DEL) is a family of logics that extend Epistemic Logic by adding dynamic modalities to the language, which represent communication and yield updates of knowledge. Among its various systems, Public Announcement Logic (PAL) provides a simple and interesting framework to analyse how knowledge gets updated through public communication. While its semantics has been extensively studied, its proof-theory remains more fragmented. In particular, the structural analysis of the announcements and their composition is yet to be refined. Deep inference naturally appears as well suited proof formalism when it comes to decompose formulas from the inside. It also offers a formalism with less syntax, that dispenses with bureaucracy. This paper presents the first deep inference proof system for PAL, using the formalism of open deduction. We show soundness, completeness, and cut admissibility for the new system.

AI 论文解读

基于摘要 · 非全文审阅

此版本尚未生成 AI 解读。解读由后台任务生成并按论文版本保存,登录后共享已有结果。

版本差异

目前只收录了一个版本。收录下一版后,可以对照标题、作者、分类和摘要。

观测到的版本

相邻记录可能跳过中间版本;首次发现 v2 及以上也会标为版本更新。

v1 · 2026-11-16 22:22 · 最新观测版本

Going Deep Inside Public Announcement Logic

Dynamic Epistemic Logic (DEL) is a family of logics that extend Epistemic Logic by adding dynamic modalities to the language, which represent communication and yield updates of knowledge. Among its various systems, Public Announcement Logic (PAL) provides a simple and interesting framework to analyse how knowledge gets updated through public communication. While its semantics has been extensively studied, its proof-theory remains more fragmented. In particular, the structural analysis of the announcements and their composition is yet to be refined. Deep inference naturally appears as well suited proof formalism when it comes to decompose formulas from the inside. It also offers a formalism with less syntax, that dispenses with bureaucracy. This paper presents the first deep inference proof system for PAL, using the formalism of open deduction. We show soundness, completeness, and cut admissibility for the new system.

查看此版本解读 →查看此版本原文 ↗