Skip to main content

Learning, Logic, and Topology in a Common Framework

  • Conference paper
  • First Online:
Algorithmic Learning Theory (ALT 2002)

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

Included in the following conference series:

Abstract

Many connections have been established between learning and logic, or learning and topology, or logic and topology. Still, the connections are not at the heart of these fields. Each of them is fairly independent of the others when attention is restricted to basic notions and main results. We show that connections can actually be made at a fundamental level, and result in a parametrized logic that needs topological notions for its early developments, and notions from learning theory for interpretation and applicability.

One of the key properties of first-order logic is that the classical notion of logical consequence is compact. We generalize the notion of logical consequence, and we generalize compactness to β-weak compactness where β is an ordinal. The effect is to stratify the set of generalized logical consequences of a theory into levels, and levels into layers. Deduction corresponds to the lower layer of the first level above the underlying theory, learning with less than β mind changes to layer β of the first level, and learning in the limit to the first layer of the second level. Refinements of Borel-like hierarchies provide the topological tools needed to develop the framework.

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 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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Ambainis, A., Jain, S., Sharma, A.: Ordinal mind change complexity of language identification. Theoretical Computer Science. 220(2) (1999) 323–343

    Article  MATH  MathSciNet  Google Scholar 

  2. Angluin, D.: Inductive Inference of Formal Languages from Positive Data. Information and Control. 45 (1980) 117–135

    Article  MATH  MathSciNet  Google Scholar 

  3. Apt, K., Bol, R.: Logic Programming and Negation: A Survey. Journal of Logic Programming. 19/20 (1994) 177–190

    Article  MathSciNet  Google Scholar 

  4. Doets, K.: From Logic to Logic Programming. The MIT Press. (1994)

    Google Scholar 

  5. Ershov, Yu.: A hierarchy of sets I, II, III. Algebra and Logika. 7(1) (1968) 47–74. 7(4) (1968) 15-47. 9(1) (1969) 34-51

    MATH  MathSciNet  Google Scholar 

  6. Freivalds, R., Smith, C.: On the role of procrastination for machine learning. Information and Computation. 107(2) (1993) 237–271

    Article  MATH  MathSciNet  Google Scholar 

  7. Gasarch, W., Pleszkoch, M., Stephan, F., Velauthapillai, M.: Classification using information. Annals of Mathematics and Artificial Intelligence. Selected papers from ALT 1994 and AII 1994. 23 (1998) 147–168

    Article  MATH  MathSciNet  Google Scholar 

  8. Gold, E.: Language Identification in the Limit. Information and Control. 10 (1967) 447–474

    Article  MATH  Google Scholar 

  9. Jain, S., Sharma, A.: Elementary formal systems, intrinsic complexity, and procrastination. Information and Computation. 132(1) (1997) 65–84

    Article  MATH  MathSciNet  Google Scholar 

  10. Kechris, A.: Classical Descriptive Set Theory. Graduate Texts in Mathematics 156. Springer-Verlag. (1994)

    Google Scholar 

  11. Keisler, H.: Fundamentals of Model Theory. In Barwise, J., ed.: Handbook of Mathematical Logic, Elsevier. (1977)

    Google Scholar 

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

    Google Scholar 

  13. Lukaszewicz, W.: Non-Monotonic Reasoning, formalization of commonsense reasoning. Ellis Horwood Series in Artificial Intelligence. (1990)

    Google Scholar 

  14. Makkai, M.: Admissible Sets and Infinitary Logic. In Barwise, J., ed.: Handbook of Mathematical Logic, Elsevier. (1977)

    Google Scholar 

  15. Martin, E., Osherson, D.: Elements of Scientific Inquiry. The MIT Press. (1998)

    Google Scholar 

  16. Martin, E., Sharma, A., Stephan, F.: A General Theory of Deduction, Induction, and Learning. In Jantke, K., Shinohara, A.: Proceedings of the Fourth International Conference on Discovery Science. Springer-Verlag. (2001) 228–242

    Google Scholar 

  17. Martin, E., Nguyen, P., Sharma, A., Stephan, F.: Learning in Logic with RichProlog. Proceedings of the Eighteenth International Conference on Logic Programming. To appear. (2002)

    Google Scholar 

  18. Nienhuys-Cheng, S., de Wolf, R.: Foundations of Inductive Logic Programming. Lecture Notes in Artificial Intelligence, Springer-Verlag. (1997)

    Google Scholar 

  19. Odifreddi, P.: Classical Recursion Theory. North-Holland. (1989)

    Google Scholar 

  20. Osherson, D., Stob, M., Weinstein, S. Systems that learn. The MIT Press. (1986)

    Google Scholar 

  21. Popper, K.: The Logic of Scientific Discovery. Hutchinson. (1959)

    Google Scholar 

  22. Stephan, F.: On one-sided versus two-sided classification Archive for Mathematical Logic. 40 (2001) 489–513.

    Article  MATH  MathSciNet  Google Scholar 

  23. Stephan, F., Terwijn, A.: Counting extensional differences in BC-learning. In Proccedings of the 5th International Colloquium Grammatical Inference, Lisbon, Portugal. Springer-Verlag. (2000) 256–269

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Martin, E., Sharma, A., Stephan, F. (2002). Learning, Logic, and Topology in a Common Framework. In: Cesa-Bianchi, N., Numao, M., Reischuk, R. (eds) Algorithmic Learning Theory. ALT 2002. Lecture Notes in Computer Science(), vol 2533. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36169-3_21

Download citation

  • DOI: https://doi.org/10.1007/3-540-36169-3_21

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-00170-6

  • Online ISBN: 978-3-540-36169-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics