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.

Authors

Publication Details

Journal
arXiv (Cornell University)
Published
2026-11-16
DOI
https://doi.org/10.48550/arxiv.2611.21157
Primary Topic
Logic, Reasoning, and Knowledge
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

Going Deep Inside Public Announcement Logic

Lutz Straßburger, Clara Lerouvillois
arXiv (Cornell University)
Logic, Reasoning, and Knowledge
preprint

Going Deep Inside Public Announcement Logic

Lutz Straßburger, Clara Lerouvillois
preprint en

Abstract

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.

arXiv (Cornell University)
Logic, Reasoning, and Knowledge
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon