Inferentialist Public Announcement Logic: Base-extension Semantics
Timo Eckhardt, David J. Pym

TL;DR
This paper develops a base-extension semantics for public announcement logic rooted in inferentialist proof-theoretic semantics, extending prior modal semantics to account for information updates through announcements.
Contribution
It introduces a novel base-extension semantics for public announcement logic that explicitly models information updates via modal relations on bases, grounded in inferentialist principles.
Findings
Analyzed the three-player card game example.
Examined the muddy children puzzle.
Extended semantics to handle announcement updates.
Abstract
Proof-theoretic semantics, and base-extension semantics in particular, can be seen as a logical realization of inferentialism, in which the meaning of expressions is understood through their use. We present a base-extension semantics for public announcement logic, building on earlier work giving a base-extension semantics for the modal logic , which in turn builds on earlier such work for , , , and . These analyses rely on a notion of `modal relation' on bases. The main difficulty in extending the existing B-eS for to public announcement logic is to account announcements of the form , which, in this setting, update the modal relations on bases. We provide a detailed analysis of two classical examples, namely the three-player card game and the muddy children puzzle. These examples illustrate how the inferentialist perspective requires fully explicit…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsSemantic Web and Ontologies
