2011 | OriginalPaper | Chapter
Schematic Validity in Dynamic Epistemic Logic: Decidability
Authors : Wesley H. Holliday, Tomohiro Hoshi, Thomas F. Icard III
Published in: Logic, Rationality, and Interaction
Publisher: Springer Berlin Heidelberg
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
Unlike standard modal logics, many dynamic epistemic logics are not closed under uniform substitution. The classic example is Public Announcement Logic (
PAL
), an extension of epistemic logic based on the idea of information acquisition as elimination of possibilities. In this paper, we address the open question of whether the set of
schematic validities
of
PAL
, the set of formulas all of whose substitution instances are valid, is decidable. We obtain positive answers for multi-agent
PAL
, as well as its extension with relativized common knowledge,
PAL-RC
. The conceptual significance of substitution failure is also discussed.