2011/07/25 by Can Başķent, Can Baskent, Baskent, Can
Computer Science · #Computer Science and Game Theory (cs.GT) #FOS: Computer and information sciences #Logic in Computer Science (cs.LO) #Logic, Reasoning, and Knowledge #Multi-Agent Systems and Negotiation #Multiagent Systems (cs.MA) #Semantic Web and Ontologies #cs.GT #cs.LO #cs.MA
paper · pdf · doi:10.48550/arxiv.1107.4935
openalex publication_date 2011/07/25 · arxiv created 2011/08/18 · arxiv updated 2011/08/19 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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. Moreover, we apply our results to different issues: announcement stabilization, backward induction and persistence.