Skip to main content

Arbitrary Announcements on Topological Subset Spaces

  • Conference paper
  • First Online:
Multi-Agent Systems (EUMAS 2014)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 8953))

Included in the following conference series:

Abstract

Subset space semantics for public announcement logic in the spirit of the effort modality have been proposed by Wang and Ågotnes [18] and by Bjorndahl [6]. They propose to model the public announcement modality by shrinking the epistemic range with respect to which a postcondition of the announcement is evaluated, instead of by restricting the model to the set of worlds satisfying the announcement. Thus we get an “elegant, model-internal mechanism for interpreting public announcements” [6, p. 12]. In this work, we extend Bjorndahl’s logic \(PAL_{int}\) of public announcement, which is modelled on topological spaces using subset space semantics and adding the interior operator, with an arbitrary announcement modality, and we provide topological subset space semantics for the corresponding arbitrary announcement logic \(APAL_{int}\), and demonstrate completeness of the logic by proving that it is equal in expressivity to the logic without arbitrary announcements, employing techniques from [2, 13].

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Notes

  1. 1.

    Equivalently, for any \(A\subseteq X\), \({ Int } (A) =\bigcup \{U\in \tau : U\subseteq A\}\).

  2. 2.

    The classic example for such situations is the well-known Moore sentences (see e.g. [12, 15] among others).

References

  1. Aiello, M., Pratt-Hartmann, I., van Benthem, J. (eds.): Handbook of Spatial Logics. Springer, Heidelberg (2007)

    MATH  Google Scholar 

  2. Balbiani, P., Baltag, A., van Ditmarsch, H., Herzig, A., Hoshi, T., de Lima, T.: ‘Knowable’ as ‘known after an announcement’. Rev. Symb. Log. 1(3), 305–334 (2008)

    Article  MATH  Google Scholar 

  3. Balbiani, Philippe, van Ditmarsch, Hans, Kudinov, Andrey: Subset space logic with arbitrary announcements. In: Lodaya, Kamal (ed.) Logic and Its Applications. LNCS, vol. 7750, pp. 233–244. Springer, Heidelberg (2013)

    Chapter  Google Scholar 

  4. Baskent, C.: Topics in Subset Space Logic. Master’s thesis, University of Amsterdam, Amsterdam, The Netherlands (2007)

    Google Scholar 

  5. Baskent, C.: Public announcement logic in geometric frameworks. Fundam. Inform. 118, 207–223 (2012)

    MATH  MathSciNet  Google Scholar 

  6. Bjorndahl, A.: Subset space public announcement logic revisited. CoRR, abs/1302.4009 (2013)

    Google Scholar 

  7. Dabrowski, A., Moss, L.S., Parikh, R.: Topological reasoning and the logic of knowledge. Ann. Pure Appl. Logic 78, 73–110 (1996)

    Article  MATH  MathSciNet  Google Scholar 

  8. Engelking, R.: General Topology. Heldermann, Berlin (1989)

    MATH  Google Scholar 

  9. Fitch, F.B.: A logical analysis of some value concepts. J. Symb. Log. 28, 135–142 (1963)

    Article  MathSciNet  Google Scholar 

  10. Heinemann, Bernhard: Topology and knowledge of multiple agents. In: Geffner, Hector, Prada, Rui, Machado Alexandre, Isabel, David, Nuno (eds.) IBERAMIA 2008. LNCS (LNAI), vol. 5290, pp. 1–10. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  11. Heinemann, B.: Logics for multi-subset spaces. J. Appl. Non Class. Log. 20, 219–240 (2010)

    Article  MATH  MathSciNet  Google Scholar 

  12. Holliday, W.H., Icard, T.F.: Moorean phenomena in epistemic logic. Adv. Modal Log. 8, 178–199 (2010)

    MathSciNet  Google Scholar 

  13. Meyer, J.-J.C., van der Hoek, W.: Epistemic Logic for AI and Computer Science. Cambridge Tracts in Theoretical Computer Science, vol. 41. Cambridge University Press, Cambridge (1995)

    Book  MATH  Google Scholar 

  14. van Benthem, J.: What one may come to know. Analysis 64(2), 95–105 (2004)

    Article  MATH  Google Scholar 

  15. van Ditmarsch, H., van der Hoek, W., Kooi, B.: Dynamic Epistemic Logic. Springer, Dordrecht (2007)

    Book  Google Scholar 

  16. Vickers, S.: Topology via Logic. Cambridge Tracts in Theoretical Computer Science, vol. 5. Cambridge University Press, Cambridge (1989)

    MATH  Google Scholar 

  17. Wáng, Y.N., Ågotnes, T.: Multi-agent subset space logic. In: Proceedings of 23rd IJCAI, pp. 1155–1161 (2013)

    Google Scholar 

  18. Wáng, Yì N., Ågotnes, Thomas: Subset space public announcement logic. In: Lodaya, Kamal (ed.) Logic and Its Applications. LNCS, vol. 7750, pp. 245–257. Springer, Heidelberg (2013)

    Chapter  Google Scholar 

Download references

Acknowledgments

We thank the EUMAS reviewers and Philippe Balbiani for their valuable comments. Hans van Ditmarsch is also affiliated to IMSc (Institute of Mathematical Sciences), Chennai, as research associate. We acknowledge support from European Research Council grant EPS 313360.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Aybüke Özgün .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

van Ditmarsch, H., Knight, S., Özgün, A. (2015). Arbitrary Announcements on Topological Subset Spaces. In: Bulling, N. (eds) Multi-Agent Systems. EUMAS 2014. Lecture Notes in Computer Science(), vol 8953. Springer, Cham. https://doi.org/10.1007/978-3-319-17130-2_17

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-17130-2_17

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-17129-6

  • Online ISBN: 978-3-319-17130-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics