Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
144 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Inferentialist Public Announcement Logic: Base-extension Semantics (2411.15775v2)

Published 24 Nov 2024 in math.LO

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 $S5$, which in turn builds on earlier such work for $K$, $KT$, $K4$, and $S4$. These analyses rely on a notion of `modal relation' on bases. The main difficulty in extending the existing B-eS for $S5$ to public announcement logic is to account announcements of the form $[\psi]\phi$, 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 information about the state of the participating agents.

Summary

We haven't generated a summary for this paper yet.