DYNAMIC HYPERSEQUENTS FOR PUBLIC ANNOUNCEMENT LOGIC
Abstract
Abstract Dynamic epistemic logic extends classical epistemic logic by modeling not only static knowledge but also its evolution through information updates. Among its various systems, public announcement logic (PAL) provides one of the simplest and most studied frameworks for representing epistemic change (see [6]). While the semantics of PAL is well understood as transformation of Kripke models, the existing proof theory might fail to fully capture this dynamism at the syntactic level. In this paper we propose a step toward addressing this gap. In particular, building on the hypersequent calculus for S5 introduced in [15], we extend it with a mechanism that models the transition between epistemic models induced by public announcements. We call these structures dynamic hypersequents (DHSs). Using DHSs, we construct a calculus for PAL and show that it enjoys several desirable properties: admissibility of all structural rules (including contraction), invertibility of logical rules, as well as syntactic cut-elimination.
Fields of Study & Subjects
Logic
Reasoning
and Knowledge
Multi-Agent Systems and Negotiation
programming
and type systems
Publication details
- Journal / source
- The Review of Symbolic Logic
- Publisher
- Cambridge University Press (CUP)
- Volume
- 19
- Issue
- 3
- Pages
- 491–518
- Publication date
- 25 June 2026
- Language
- EN