Skip to main content
Springer Nature Link
Log in

Connecting Proof Checkers and Computer Algebra Using OpenMath

  • Conference paper
  • First Online:
Theorem Proving in Higher Order Logics (TPHOLs 1999)

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

Included in the following conference series:

  • 436 Accesses

Abstract

Interactive mathematics over the Internet is particularly appealing in that it can take advantage of the wealth of resources available online. In particular, a problem-solving framework integrating computing and proving tools is of great interest. Several modes of advantageous cooperation can be envisioned. Proving is undoubtedly useful to computation for checking assertions and side conditions, whereas computation is useful for shortening the lengths of proofs. Both modes are definitely needed in interactive mathematics. In the interaction we do not want to waste resources by sending or receiving meaningless requests. There Strong OpenMath comes in, as it is possible to type-check the well-typedeness, hence the meaningfullness, of the mathematical objects it represents.

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

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

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.

Similar content being viewed by others

References

  1. John A. Abbott, André van Leeuwen, and A. Strotmann. OpenMath: Communicating Mathematical Information between Co-operating Agents in a Knowledge Network. Journal of Intelligent Systems, 1998. Special Issue: “Improving the Design of Intelligent Systems: Outstanding Problems and Some Methods for their Solution.”.

    Google Scholar 

  2. A. M. Cohen, H. Cuypers, and H. Sterk. Algebra Interactive, interactive course material. Number ISBN 3-540-65368-6. SV, 1999.

    Google Scholar 

  3. S. Dalmas, M. Gaëtano, and S. Watt. An OpenMath 1.0 Implementation. pages 241–248. ACM Press, 1997.

    Google Scholar 

  4. Z. Luo and R. Pollack. LEGO Proof Development System: User’s Manual. Department of Compter Science, University of Edinburgh, 1992.

    Google Scholar 

  5. PolyMath OpenMath Development Team. Java openmath library, version 0.5. Available at http://pdg.cecm.sfu.ca/openmath/lib/, July 1998.

  6. Projet Coq. The Coq Proof Assistant: The standard library, version 6.1 edition. Available at http://www.ens-lyon.fr/LIP/groupes/coq.

  7. The OpenMath Consortium. The OpenMath Standard. OpenMath Deliverable 1.3.1a, September 1998. Public at http://www.nag.co.uk/projects/OpenMath.html.

Download references

Author information

Authors and Affiliations

  1. RIACA, Technical University of Eindhoven, The Netherlands

    Olga Caprotti & Arjeh M. Cohen

Authors
  1. Olga Caprotti
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Arjeh M. Cohen
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. INRIA Sophia Antipolis, 2004 Route des Lucioles, F-06902, Sophia Antipolis Cedex, France

    Yves Bertot , Gilles Dowek  & Laurent Théry ,  & 

  2. University of Nice - Sophia Antipolis, Parc Valrose, F-06108, Nice Cedex 2, France

    André Hirschowitz

  3. University of Paris XI, 15, rue Georges Clemenceau, F-91405, Orsay Cedex, France

    Christine Paulin

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Caprotti, O., Cohen, A.M. (1999). Connecting Proof Checkers and Computer Algebra Using OpenMath . In: Bertot, Y., Dowek, G., Théry, L., Hirschowitz, A., Paulin, C. (eds) Theorem Proving in Higher Order Logics. TPHOLs 1999. Lecture Notes in Computer Science, vol 1690. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48256-3_8

Download citation

  • DOI: https://doi.org/10.1007/3-540-48256-3_8

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-48256-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics