Skip to main content

Information Retrieval in MML

  • Conference paper
  • First Online:
Mathematical Knowledge Management (MKM 2003)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2594))

Included in the following conference series:

Abstract

Mizar, a proof-checking system, is used to build the Mizar Mathematical Library (MML). This is a long term project aiming at building a comprehensive library of mathematical knowledge. We describe issues concerning information retrieval, i.e., searching, browsing and presentation of MML contents. A web-based tool providing such functionalities is being implemented by G. Bancerek. We hope that our observations are helpful when solving similar problems for other repositories of formalized mathematics.

Partially supported by JSPS P00025.

Partially supported by NSERC grant OGP9207.

http://mizar.org

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. Grzegorz Bancerek and Krzysztof Hryniewiecki. Segments of natural numbers and finite sequences. Formalized Mathematics, 1(1):107–114, 1990.

    Google Scholar 

  2. David Delahaye. Information Retrieval in a Coq Proof Library using Type Isomorphisms. In T. Coquand et al., editors, TYPES, volume 1956 of LNCS, pages 131–147. Springer, 2000.

    Google Scholar 

  3. Mizar Manuals. http://mizar.org/project/bibliography.html.

  4. P. Rudnicki, Ch. Schwarzweller and A. Trybulec. Commutative Algebra in the Mizar System. Journal of Symbolic Computation, 32:143–169, 2001.

    Article  MathSciNet  Google Scholar 

  5. Piotr Rudnicki and Andrzej Trybulec. On equivalents of well-foundedness. Journal of Automated Reasoning, 23(3–4):197–234, 1999.

    Article  MathSciNet  Google Scholar 

  6. Andrzej Trybulec. Tarski Grothendieck set theory. Formalized Mathematics, 1(1):9–11, 1990.

    Google Scholar 

  7. Wojciech A. Trybulec. Partially ordered sets. Formalized Mathematics, 1(2):313–319, 1990.

    Google Scholar 

  8. Wojciech A. Trybulec. Non-contiguous substrings and one-to-one finite sequences. Formalized Mathematics, 1(3):569–573, 1990.

    Google Scholar 

  9. Edmund Woronowicz. Relations and their basic properties. Formalized Mathematics, 1(1):73–83, 1990.

    Google Scholar 

  10. Mariusz Żynel and Czesław Byliński. Properties of relational structures, posets, lattices and maps. Formalized Mathematics, 6(1):123–130, 1997.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bancerek, G., Rudnicki, P. (2003). Information Retrieval in MML. In: Asperti, A., Buchberger, B., Davenport, J.H. (eds) Mathematical Knowledge Management. MKM 2003. Lecture Notes in Computer Science, vol 2594. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36469-2_10

Download citation

  • DOI: https://doi.org/10.1007/3-540-36469-2_10

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-00568-1

  • Online ISBN: 978-3-540-36469-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics