Skip to main content

A Dynamic Logic for Learning Theory

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 10669))

Abstract

Building on previous work [4, 5] that bridged Formal Learning Theory and Dynamic Epistemic Logic in a topological setting, we introduce a Dynamic Logic for Learning Theory (DLLT), extending Subset Space Logics [9, 17] with dynamic observation modalities \([o]\varphi \), as well as with a learning operator , which encodes the learner’s conjecture after observing a finite sequence of data . We completely axiomatise DLLT, study its expressivity and use it to characterise various notions of knowledge, belief, and learning.

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

Buying options

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

Learn about institutional subscriptions

Notes

  1. 1.

    From probabilistic and statistical formalisms based on Bayesian reasoning, Popper-style measures of corroboration, through default and non-monotonic logics, Carnap-style ‘inductive logic’, to AGM-style rational belief revision and theory change.

  2. 2.

    ‘The Logic of Reliable Inquiry’ is the title of a classic text in FLT-based epistemology [16].

  3. 3.

    We will return to it, with complete definitions, later in the paper. Our DLLT is interpreted over such frames.

  4. 4.

    In the tautological information state X, the learner believes P iff \(\mathbb {L}(X)\subseteq P\).

  5. 5.

    This topology is T1 iff for every two distinct points \(x\not =y\) there exist an observation \(O\in \mathscr {O}\) with \(x\in O\) and \(y\not \in O\).

  6. 6.

    The observational topology is T0 iff points can be distinguished by observations; i.e. if x and y satisfy the same observable properties in \(\mathscr {O}\), then \(x=y\). Obviously, T0 is a minimally necessary condition for any kind of learnability of the real world from observations.

  7. 7.

    A set is locally closed if it is the intersection of a closed and an open set.

References

  1. Aiello, M., Pratt-Hartmann, I., van Benthem, J. (eds.): Handbook of Spatial Logics, vol. 4. Springer, Dordrecht (2007). https://doi.org/10.1007/978-1-4020-5587-4

    MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  3. Balbiani, P., van Ditmarsch, H., Kudinov, A.: Subset space logic with arbitrary announcements. In: Lodaya, K. (ed.) ICLA 2013. LNCS, vol. 7750, pp. 233–244. Springer, Heidelberg (2013). https://doi.org/10.1007/978-3-642-36039-8_21

    Chapter  Google Scholar 

  4. Baltag, A., Gierasimczuk, N., Smets, S.: Belief revision as a truth-tracking process. In: Proceedings of the 13th Conference on Theoretical Aspects of Rationality and Knowledge, pp. 187–190. ACM (2011)

    Google Scholar 

  5. Baltag, A., Gierasimczuk, N., Smets, S.: On the solvability of inductive problems: a study in epistemic topology. In: Ramanujam, R. (ed.) Proceedings of the 15th Conference TARK, Also Available as a Technical Report in ILLC Prepublication Series PP-2015-13 (2015)

    Google Scholar 

  6. Baltag, A., Moss, L.S., Solecki, S.: The logic of public announcements, common knowledge, and private suspicions. In: Proceedings of the 7th Conference TARK, pp. 43–56. Morgan Kaufmann Publishers Inc. (1998)

    Google Scholar 

  7. Baltag, A., Özgün, A., Vargas Sandoval, A.L.: Topo-logic as a dynamic-epistemic logic. In: Baltag, A., Seligman, J., Yamada, T. (eds.) LORI 2017. LNCS, vol. 10455, pp. 330–346. Springer, Heidelberg (2017). https://doi.org/10.1007/978-3-662-55665-8_23

    Chapter  Google Scholar 

  8. Bjorndahl, A.: Topological subset space models for public announcements. In: Trends in Logic, Outstanding Contributions: Jaakko Hintikka (2016, to appear)

    Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  10. Dégremont, C., Gierasimczuk, N.: Finite identification from the viewpoint of epistemic update. Inf. Comput. 209, 383–396 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  11. Georgatos, K.: Knowledge theoretic properties of topological spaces. In: Masuch, M., Pólos, L. (eds.) Logic at Work 1992. LNCS, vol. 808, pp. 147–159. Springer, Heidelberg (1994). https://doi.org/10.1007/3-540-58095-6_11

    Chapter  Google Scholar 

  12. Georgatos, K.: Knowledge on treelike spaces. Stud. Logica. 59, 271–301 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  13. Gierasimczuk, N.: Knowing one’s limits. Logical analysis of inductive inference. Ph.D. thesis, Universiteit van Amsterdam, The Netherlands (2010)

    Google Scholar 

  14. Gierasimczuk, N., de Jongh, D.: On the complexity of conclusive update. Comput. J. 56, 365–377 (2013)

    Article  Google Scholar 

  15. Gold, E.M.: Language identification in the limit. Inf. Control 10, 447–474 (1967)

    Article  MathSciNet  MATH  Google Scholar 

  16. Kelly, K.T.: The Logic of Reliable Inquiry. Oxford University Press, Oxford (1996)

    MATH  Google Scholar 

  17. Moss, L.S., Parikh, R.: Topological reasoning and the logic of knowledge. In: Proceedings of the 4th Conference TARK, pp. 95–105. Morgan Kaufmann (1992)

    Google Scholar 

  18. Parikh, R., Moss, L.S., Steinsvold, C.: Topology and epistemic logic. In: Aiello, M., Pratt-Hartmann, I., Van Benthem, J. (eds.) Handbook of Spatial Logics, pp. 299–341. Springer, Dordrecht (2007). https://doi.org/10.1007/978-1-4020-5587-4_6

    Chapter  Google Scholar 

  19. van Benthem, J.: Logical Dynamics of Information and Interaction. Cambridge University Press, New York (2011)

    Book  MATH  Google Scholar 

  20. van Ditmarsch, H., Knight, S., Özgün, A.: Arbitrary announcements on topological subset spaces. In: Bulling, N. (ed.) EUMAS 2014. LNCS (LNAI), vol. 8953, pp. 252–266. Springer, Cham (2015). https://doi.org/10.1007/978-3-319-17130-2_17

    Google Scholar 

  21. van Ditmarsch, H., Knight, S., Özgün, A.: Announcement as effort on topological spaces. In: Proceedings of the 15th TARK, pp. 95–102 (2015)

    Google Scholar 

  22. van Ditmarsch, H., Knight, S., Özgün, A.: Announcement as effort on topological spaces. Extended version, Submitted (2015). http://www.lix.polytechnique.fr/sophia/papers/effort.pdf

  23. van Ditmarsch, H., van der Hoek, W., Kooi, B.: Dynamic Epistemic Logic, 1st edn. Springer, Dordrecht (2008). https://doi.org/10.1007/978-1-4020-5839-4

    MATH  Google Scholar 

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

    MATH  Google Scholar 

  25. Wang, Y.N., Ågotnes, T.: Multi-agent subset space logic. In: Proceedings of the 23rd IJCAI, pp. 1155–1161. IJCAI/AAAI (2013)

    Google Scholar 

  26. Weiss, M.A., Parikh, R.: Completeness of certain bimodal logics for subset spaces. Stud. Logica. 71, 1–30 (2002)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Acknowledgements

The research of Nina Gierasimczuk is supported by an Innovational Research Incentives Scheme Veni grant 275-20-043, Netherlands Organisation for Scientific Research (NWO) and by the OPUS grant 2015/19/B/HS1/03292, National Science Centre Poland (NCN). Aybüke Özgün acknowledges financial support from European Research Council grant EPS 313360.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Ana Lucia Vargas Sandoval .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer International Publishing AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Baltag, A., Gierasimczuk, N., Özgün, A., Vargas Sandoval, A.L., Smets, S. (2018). A Dynamic Logic for Learning Theory. In: Madeira, A., Benevides, M. (eds) Dynamic Logic. New Trends and Applications. DALI 2017. Lecture Notes in Computer Science(), vol 10669. Springer, Cham. https://doi.org/10.1007/978-3-319-73579-5_3

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-73579-5_3

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-73578-8

  • Online ISBN: 978-3-319-73579-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics