Skip to Main content Skip to Navigation
Conference papers

Subset space logic with arbitrary announcements

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.
Complete list of metadata

Cited literature [18 references]  Display  Hide  Download
Contributor : Open Archive Toulouse Archive Ouverte (oatao) <>
Submitted on : Monday, September 21, 2015 - 11:44:17 AM
Last modification on : Thursday, March 18, 2021 - 2:24:41 PM
Long-term archiving on: : Tuesday, December 29, 2015 - 8:55:58 AM


Files produced by the author(s)


  • HAL Id : hal-01202518, version 1
  • OATAO : 12878


Philippe Balbiani, Hans van Ditmarsch, Andrey Kudinov. Subset space logic with arbitrary announcements. 5th Indian Conference on Logics and its Applications (ICLA), Jan 2013, Chennai, India. pp. 233-244. ⟨hal-01202518⟩



Record views


Files downloads