Skip to main content

Narrative Structure of Mathematical Texts

  • Conference paper

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

Abstract

There are many styles for the narrative structure of a mathematical document. Each mathematician has its own conventions and traditions about labeling portions of texts (e.g., chapter, section, theorem or proof ) and identifying statements according to their logical importance (e.g., theorem is more important than lemma). Such narrative/structuring labels guide the reader’s navigation of the text and form the key components in the reasoning structure of the theory reflected in the text.

We present in this paper a method to computerise the narrative structure of a text which includes the relationships between labeled text entities. These labels and relations are input by the user on top of their natural language text. This narrative structure is then automatically analysed to check its consistency. This automatic analysis consists of two phases: (1) checking the correct usage of labels and relations (i.e., that a ”proof” justifies a ”theorem” but cannot justify an ”axiom”) and (2) checking that the logical precedences in the document are self-consistent.

The development of this method was driven by the experience of computerising a number of mathematical documents (covering different authoring styles). We illustrate how such computerised narrative structure could be used for further manipulations, i.e. to build a skeleton of a formal document in a formal system like Mizar, Coq or Isabelle.

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. de Bruijn, N.G.: The mathematical vernacular, a language for mathematics with typed sets. In: Workshop on Programming Logic, Sweden (1987)

    Google Scholar 

  2. Biron, P.V., Malhotra, A.: XML Schema Part 2: Datatypes. W3C Recommendation (2001)

    Google Scholar 

  3. Kamareddine, F., Wells, J.: MathLang: A new language for mathematics, logic, and proof checking. A research proposal to UK funding body (2001)

    Google Scholar 

  4. Kamareddine, F., Maarek, M., Retel, K., Wells, J.B.: Gradual computerisation/formalisation of mathematical texts into mizar (2007), http://www.macs.hw.ac.uk/~retel/

  5. Kamareddine, F., Lamar, R., Maarek, M., Wells, J.B.: Restoring Natural Language as a Computerised Mathematics Input Method (2007), http://www.macs.hw.ac.uk/~mm20/

  6. Kamareddine, F., Maarek, M., Wells, J.B.: Toward an object-oriented structure for mathematical text. In: Kohlhase, M. (ed.) MKM 2005. LNCS (LNAI), vol. 3863, Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  7. Kamareddine, F., Nederpelt, R.: A refinement of de Bruijn’s formal language of mathematics. J. Logic Lang. Inform. 13(3), 287–340 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  8. Kohlhase, M.: OMDoc – An Open Markup Format for Mathematical Documents [version 1.2]. LNCS (LNAI), vol. 4180. Springer, Heidelberg (2006)

    Google Scholar 

  9. Lange, Ch.: SWiM – A Semantic Wiki for Mathematical Knowledge Management. Technical Report (December 2006)

    Google Scholar 

  10. Lassila, O., Swick, R.R.: Resource Description Framework (RDF) Model and Syntax Specification. W3C Recommendation (1999)

    Google Scholar 

  11. McGuinness, D.L., van Harmelen, F.: OWL Web Ontology Language Overview. W3C Recommendation (2004)

    Google Scholar 

  12. Moller, J.M.: General topology. Authors’ notes (last visit 2007-02-25), available at http://www.math.ku.dk/~moller/e03/3gt/notes/gtnotes.pdf

  13. Nakagawa, K., Suzuki, M.: Mathematical knowledge browser with automatic hyperlink detection. In: Kohlhase, M. (ed.) MKM 2005. LNCS (LNAI), vol. 3863, Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  14. Nakagawa, K., Nomura, A., Suzuki, M.: Extraction of Logical Structure from Articles in Mathematics. In: Kohlhase, M. (ed.) MKM 2005. LNCS (LNAI), vol. 3863, Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  15. Roy, B.: Transitivité et connexité. C.R. Acad. Sci. Paris 249, 216–218 (1959)

    MATH  MathSciNet  Google Scholar 

  16. Rudnicki, P., Trybulec, A.: On equivalents of well-foundedness. An experiment in MIZAR. Journal of Automated Reasoning 23(3–4), 197–234 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  17. Sierpiński, W.: Elementary Theory of Numbers. PWN, Warszawa (1964)

    Google Scholar 

  18. Smith, M.K., Welty, Ch., McGuinness, D.L.: OWL Web Ontology Language Guide. W3C Recommendation (2004)

    Google Scholar 

  19. Warshall, S.: A theorem on boolean matrices. J. ACM 9(1), 11–12 (1962)

    MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Manuel Kauers Manfred Kerber Robert Miner Wolfgang Windsteiger

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kamareddine, F., Maarek, M., Retel, K., Wells, J.B. (2007). Narrative Structure of Mathematical Texts. In: Kauers, M., Kerber, M., Miner, R., Windsteiger, W. (eds) Towards Mechanized Mathematical Assistants. MKM Calculemus 2007 2007. Lecture Notes in Computer Science(), vol 4573. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-73086-6_24

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-73086-6_24

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-73083-5

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

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics