Skip to main content
SpringerLink
Log in

Solving Two Problems in General Topology Via Types

  • Conference paper
Types for Proofs and Programs (TYPES 2004)

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

Included in the following conference series:

Abstract

In the paper we show, based on two problems in general topology (Kuratowski closure-complement and Isomichi’s classification of condensed subsets), how typed objects can be used instead of untyped text to better represent mathematical content understandable both for human and computer checker. We present mechanism of attributes and clusters reimplemented in Mizar fairly recently to fit authors’ expectations. The problem of knowledge reusability which is crucial if we develop a large unified repository of mathematical facts, is also addressed.

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

Access this chapter

Log in via an institution
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. Journal of Formalized Mathematics, accessible at, http://mizar.uwb.edu.pl/JFM/ , Mizar library available at, ftp://mizar.uwb.edu.pl/pub/mml/

  2. Bagińska, L.K., Grabowski, A.: On the Kuratowski closure-complement problem. Formalized Mathematics 11(3), 321–327 (2003); MML Id in [1]: KURAT0_1

    Google Scholar 

  3. Bancerek, G.: On the structure of Mizar types. In: Geuvers, H., Kamareddine, F. (eds.) Proc. of MLC 2003. ENTCS, vol. 85(7) (2003)

    Google Scholar 

  4. Cairns, P., Gow, J., Collins, P.: On dynamically presenting a topology course. Annals of Mathematics and Artificial Intelligence 38(1-3), 91–104 (2003)

    Article  MATH  Google Scholar 

  5. Cruz-Filipe, L., Geuvers, H., Wiedijk, F.: C-CoRN, the Constructive Coq Repository at Nijmegen. In: Asperti, A., Bancerek, G., Trybulec, A. (eds.) MKM 2004. LNCS, vol. 3119, pp. 88–103. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  6. Darmochwał, A.: Families of subsets, subspaces and mappings in topological spaces. Formalized Mathematics 1(2), 257–261 (1990); MML Id in [1]: TOPS_2

    Google Scholar 

  7. Gierz, G., Hofmann, K.H., Keimel, K., Lawson, J.D., Mislove, M., Scott, D.S.: A Compendium of Continuous Lattices. Springer, Heidelberg (1980)

    MATH  Google Scholar 

  8. Isomichi, Y.: New concepts in the theory of topological space – supercondensed set, subcondensed set, and condensed set. Pacific Journal of Mathematics 38(3), 657–668 (1971)

    MATH  MathSciNet  Google Scholar 

  9. Jastrzȩbska, M., Grabowski, A.: The properties of supercondensed sets, subcondensed sets, and condensed sets. To appear in Formalized Mathematics (2005); MML Id in [1]: ISOMICHI

    Google Scholar 

  10. Kelley, J.L.: General Topology. Van Nostrand (1955)

    Google Scholar 

  11. Kuratowski, K.: Sur l’opération \(\overline{A}\) de l’Analysis Situs. Fundamenta Mathematicae 3, 182–199 (1922)

    MATH  Google Scholar 

  12. Kuratowski, K.: Topology. PWN – Polish Scientific Publishers, Warszawa (1966)

    Google Scholar 

  13. Padlewska, B., Darmochwał, A.: Topological spaces and continuous functions. Formalized Mathematics 1(1), 223–230 (1990); MML Id in [1]: PRE_TOPC

    Google Scholar 

  14. Romanowicz, E., Grabowski, A.: Hall Marriage Theorem. Formalized Mathematics 12(3), 315–320 (2004); MML Id in [1]: HALLMAR1

    Google Scholar 

  15. Rusin, D.: Posting, available at, http://www.math.niu.edu/~rusin/known-math/94/kuratowski

  16. Sambin, G.: Some points in formal topology. Theoretical Computer Science 305(1-3), 347–408 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  17. Sherman, D.: Variations on Kuratowski’s 14-set theorem, available at, http://www.math.uiuc.edu/~dasherma/14-sets.pdf

  18. Takeuchi, Y., Nakamura, Y.: On the Jordan curve theorem. Shinshu Univ. (1980)

    Google Scholar 

  19. Wiedijk, F.: Seventeen provers of the world, available at, http://www.cs.ru.nl/~freek/comparison/

  20. Weisstein, E.W., et al.: Kuratowski’s closure-complement problem, from MathWorld – a Wolfram Web Resource, http://mathworld.wolfram.com/KuratowskisClosure-ComplementProblem.html

Download references

Author information

Authors and Affiliations

  1. Institute of Mathematics, University of Białystok, ul. Akademicka 2, 15-267, Białystok, Poland

    Adam Grabowski

Authors
  1. Adam Grabowski
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. LRI, Univ Paris-Sud, CNRS, Orsay F-91405, INRIA Futurs, ProVal, F-91893, Orsay

    Jean-Christophe Filliâtre

  2. INRIA Saclay - Île-de-France, ProVal - Orsay 91893 and LRI, Univ Paris-Sud, CNRS - Orsay 91405LRI, Université Paris Sud and INRIA Futurs, Bât. 490, Université Paris Sud, F-91405, Orsay Cedex, France

    Christine Paulin-Mohring

  3. INRIA-Futurs at, LIX, École Polytechnique, Palaiseau, France

    Benjamin Werner

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Grabowski, A. (2006). Solving Two Problems in General Topology Via Types. In: Filliâtre, JC., Paulin-Mohring, C., Werner, B. (eds) Types for Proofs and Programs. TYPES 2004. Lecture Notes in Computer Science, vol 3839. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11617990_9

Download citation

  • DOI: https://doi.org/10.1007/11617990_9

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-31428-8

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

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation