Modal logic
Axiomatising the Logic of Computer Programming
Axiomatising the Logic of Computer Programming
Epistemic Logic for AI and Computer Science
Epistemic Logic for AI and Computer Science
Reasoning about Information Change
Journal of Logic, Language and Information
The logic of public announcements, common knowledge, and private suspicions
TARK '98 Proceedings of the 7th conference on Theoretical aspects of rationality and knowledge
Dynamic Epistemic Logic
Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 2
A Tableau Method for Public Announcement Logics
TABLEAUX '07 Proceedings of the 16th international conference on Automated Reasoning with Analytic Tableaux and Related Methods
Group announcements: logic and games
CLIMA'10 Proceedings of the 11th international conference on Computational logic in multi-agent systems
Concrete epistemic modal logic: flatland
TICTTL'11 Proceedings of the Third international congress conference on Tools for teaching logic
Boolean modal logic wK4Dyn: doxastic interpretation
TbiLLC'09 Proceedings of the 8th international tbilisi conference on Logic, language, and computation
An alternative logic for knowability
LORI'11 Proceedings of the Third international conference on Logic, rationality, and interaction
Refinement Quantified Logics of Knowledge
Electronic Notes in Theoretical Computer Science (ENTCS)
Arbitrary Action Model Logic and Action Model Synthesis
LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science
| Hi-index | 0.00 |
Public announcement logic is an extension of multi-agent epistemic logic with dynamic operators to model the informational consequences of announcements to the entire group of agents. We propose an extension of public announcement logic with a dynamic modal operator that expresses what is true after any announcement: □ϕ expresses that ϕ is true after an arbitrary announcement ψ. As this includes the trivial announcement ⊤, one might as well say that □ϕ expresses what remains true after any announcement: it therefore corresponds to truth persistence after (definable) relativisation. The dual operation ⋄ϕ expresses that there is an announcement after which ϕ. This gives a perspective on Fitch's knowability issues: for which formulas ϕ does it hold that ϕ → ⋄Kϕ? We give various semantic results, and we show completeness for a Hilbert-style axiomatisation of this logic.