Public Announcement Logic in Geometric Frameworks

Authors:
Can Başkent
Affiliations:
(Correspd.) Department of Computer Science, The Graduate Center, The City University of New York, 365 Fifth Avenue, New York, NY 10016, USA, cbaskent@gc.cuny.edu www.canbaskent.net
Venue:
Fundamenta Informaticae
Year:
2012

Citing 5
Cited 0

Topological reasoning and the logic of knowledge

TARK '92 Proceedings of the fourth conference on Theoretical aspects of reasoning about knowledge
Reasoning about knowledge

Reasoning about knowledge
Three views of common knowledge

TARK '88 Proceedings of the 2nd conference on Theoretical aspects of reasoning about knowledge
Dynamic Epistemic Logic

Dynamic Epistemic Logic
Game Solution, Epistemic Dynamics and Fixed-Point Logics

Fundamenta Informaticae - Understanding Computers' Intelligence Celebrating the 100th Volume of Fundamenta Informaticae in Honour of Helena Rasiowa

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we introduce public announcement logic in different geometric frameworks. First, we consider topological models, and then extend our discussion to a more expressive model, namely, subset space models. Furthermore, we prove the completeness of public announcement logic in those frameworks. After that, we apply our results to different issues: announcement stabilization, backward induction and persistence.