Advertisement

The Meaning of Infinity in Calculus and Computer Algebra Systems

  • Michael Beeson
  • Freek Wiedijk
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2385)

Abstract

We use filters of open sets to provide a semantics justifying the use of infinity in informal limit calculations in calculus, and in the same kind of calculations in computer algebra. We compare the behavior of these filters to the way Mathematica behaves when calculating with infinity.

We stress the need to have a proper semantics for computer algebra expressions, especially if one wants to use results and methods from computer algebra in theorem provers. The computer algebra method under discussion in this paper is the use of rewrite rules to evaluate limits involving infinity.

Keywords

Topological Space Theorem Prover Computer Algebra Computer Algebra System Nonstandard Analysis 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Beeson, M., Mathpert Calculus Assistant. This software program (now known as MathXpert) was published in July, 1997 by Mathpert Systems, Santa Clara, CA, and is commercially available from <http://www.mathxpert.com/>.
  2. 2.
    Beeson, M., Design Principles of Mathpert: Software to support education in algebra and calculus, in: Kajler, N. (ed.) Computer-Human Interaction in Symbolic Computation, Texts and Monographs in Symbolic Computation, Springer-Verlag, Berlin/Heidelberg/New York (1998), pp. 89–115.Google Scholar
  3. 3.
    Beeson, M. MathXpert: un logiciel pour aider les élèves à apprendre les mathématiques par láction, to appear in Sciences et Techniques Educatives. An English translation of this article under the title MathXpert: learning mathematics in the twenty-first century is available at <http://www.mathcs.sjsu.edu/faculty/beeson/Pubs/pubs.html>.
  4. 4.
    Beeson, M., Using nonstandard analysis to verify the correctness of computations, International Journal of Foundations of Computer Science, 6(3) (1995), pp. 299–338.zbMATHCrossRefGoogle Scholar
  5. 5.
    K. Kuratowski. Topology, volume 1. Academic Press, New York, London, 1966.Google Scholar
  6. 6.
    M. Monagan, K. Geddes, K. Heal, G. Labahn, and S. Vorkoetter. Maple V Programming Guide for Release 5. Springer-Verlag, Berlin/Heidelberg, 1997.Google Scholar
  7. 7.
    B. Sims. Fundamentals of Topology. MacMillan, New York, 1976.zbMATHGoogle Scholar
  8. 8.
    Stewart. Calculus, 3rd edition, Brooks-Cole, Pacific Grove, CA 1995.Google Scholar
  9. 9.
    S. Wolfram. The Mathematica book. Cambridge University Press, Cambridge, 1996.zbMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2002

Authors and Affiliations

  • Michael Beeson
    • 1
  • Freek Wiedijk
    • 2
  1. 1.San José State UniversityUSA
  2. 2.University of NijmegenThe Netherlands

Personalised recommendations