Skip to main content
SpringerLink
Log in

Analytica – An Experiment in Combining Theorem Proving and Symbolic Computation

  • Published:
Journal of Automated Reasoning Aims and scope Submit manuscript

Abstract

Analytica is an automatic theorem prover for theorems in elementary analysis. The prover is written in the Mathematica language and runs in the Mathematica environment. The goal of the project is to use a powerful symbolic computation system to prove theorems that are beyond the scope of previous automatic theorem provers. The theorem prover is also able to deduce the correctness of certain simplification steps that would otherwise not be performed. We describe the structure of Analytica and explain the main techniques that it uses to construct proofs. Analytica has been able to prove several nontrivial theorems. In this paper, we show how it can prove a series of lemmas that lead to the Bernstein approximation theorem.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Baker-Plummer, D.: Gazing: An approach to the problem of definition and lemma use, J. Automated Reasoning 8 (1992), 311–344.

    Google Scholar 

  2. Ballarin, C., Homann, K., and Calmet, J.: Theorems and algorithms: An interface between Isabelle and Maple, in Proceedings of the 1995 International Symposium on Symbolic and Algebraic Computation, July 1995, Montreal, Canada.

  3. Berndt, B. C.: Ramanujan's Notebooks, Part I, Springer-Verlag, 1985.

  4. Bledsoe, W. W.: The UT natural deduction prover, Technical Report ATP-17B, Mathematical Dept., University of Texas at Austin, 1983.

    Google Scholar 

  5. Bledsoe, W. W.: Some automatic proofs in analysis, in Automated Theorem Proving: After 25 Years, American Mathematical Society, 1984.

  6. Bledsoe, W. W., Bruell, P., and Shostak, R.: A prover for general inequalities, Technical Report ATP-40A, Mathematical Dept., University of Texas at Austin, 1979.

    Google Scholar 

  7. Boyer, R. S. and Moore, J S.: A Computational Logic, Academic Press, 1979.

  8. Bundy, A., van Harmelen, F., Hesketh, J., and Smaill, A.: Experiments with proof plans for induction, Technical report, Department of Artificial Intelligence, University of Edinburgh, 1988.

  9. Clarke, E. M. and Zhao, X.: Combining symbolic computation and theorem proving: Some problems of Ramanujan, in Proceedings of 11th International Conference on Automated Deduction, 1992.

  10. Clarke, E. M. and Zhao, X.: Analytica: A theorem prover for Mathematica, J. Math. 3(1) (1993).

  11. Farmer, W. M., Guttman, J. D., and Thayer, F. J.: IMPS: An interactive mathematical proof system, Technical Report, The MITRE Corporation, 1990.

  12. Fitting, M.: First-Order Logic and Automated Theorem Proving, Springer-Verlag, 1990.

  13. Gallier, J. H.: Logic for Computer Science: Foundations of Automatic Theorem Proving, Harper & Row, 1986.

  14. Gordon, M.: HOL: A machine oriented formulation of higher order logic, Technical Report, Computer Laboratory, University of Cambridge, 1985.

  15. Gordon, M., Milner, R., and Wadsworth, C.: Edinburgh LCF: A mechanised logic of computation, in Lecture Notes in Comput. Sci. 78, Springer-Verlag, 1979.

  16. Gosper, R. W.: Indefinite hypergeometric sums in MACSYMA, in Proceedings of the MACSYMA Users Conference, 1977, pp. 237–252.

  17. Harrison, J. and Théry, L.: Extending HOL theorem prover with a computer algebra system to reason about the reals, in J. J. Joyce and C. Seger (eds), Proceedings of Higher Order Logic Theorem Proving and Its Applications, Lecture Notes in Comput. Sci. 780, Springer-Verlag, 1994.

  18. London, R. L. and Musser, D. R.: The application of a symbolic mathematical system to program verification, Technical Report, Information Science Institute, University of Southern California, 1975.

  19. Quaife, A.: Automated deduction in von Neumann–Bernays–Gödel set theory, Technical Report, Dept. of Mathematics, University of California at Berkeley, 1989.

    Google Scholar 

  20. Sacks, E.: Hierarchical inequality reasoning, Technical Report, MIT Laboratory for Computer Science, 1987.

  21. Suppes, P. and Takahashi, S.: An interactive calculus theorem-prover for continuity properties, J. Symbolic Comput. 7 (1989), 573–590.

    Google Scholar 

  22. Titchmarsh, E. C.: The Theory of Functions, Oxford University Press, 1932.

  23. Wolfram, S.: Mathematica: A System for Doing Mathematics by Computer, Wolfram Research Inc., 1988.

Download references

Author information

Authors and Affiliations

  1. School of Computer Science, Carnegie Mellon University, 5000 Forbes Avenue, Pittsburgh, PA, 15213, U.S.A.

    Andrej Bauer & Edmund Clarke

  2. JFT-102, Intel Corporation, 2111 N.E. 25th Ave., Hillsboro, OR 97124, U.S.A.

    Xudong Zhao

Authors
  1. Andrej Bauer
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Edmund Clarke
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Xudong Zhao
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Bauer, A., Clarke, E. & Zhao, X. Analytica – An Experiment in Combining Theorem Proving and Symbolic Computation. Journal of Automated Reasoning 21, 295–325 (1998). https://doi.org/10.1023/A:1006079212546

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1006079212546

Search

Navigation