Abstract
In this paper we introduce public announcements to Subset Space Logic (SSL). In order to do this we have to change the original semantics for SSL a little and consider a weaker version of SSL without the cross axiom. We present an axiomatization, prove completeness and show that this logic is PSPACE-complete. Finally, we add the arbitrary announcement modality which expresses "true after any announcement", prove several semantic results, and show completeness for a Hilbert-style axiomatization of this logic. © 2013 Springer-Verlag Berlin Heidelberg.
Cite
CITATION STYLE
Balbiani, P., Van Ditmarsch, H., & Kudinov, A. (2013). Subset space logic with arbitrary announcements. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7750 LNCS, pp. 233–244). Springer Verlag. https://doi.org/10.1007/978-3-642-36039-8_21
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
