Analytica – An Experiment in Combining Theorem Proving and Symbolic Computation

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.

[1]  William M. Farmer,et al.  IMPS: An interactive mathematical proof system , 1990, Journal of Automated Reasoning.

[2]  M. Fitting.  First-order logic and automated theorem proving (2nd ed.) , 1996 .

[3]  Edmund M. Clarke,et al.  Analytica - A Theorem Prover in Mathematica , 1992, CADE.

[4]  R. W. Gosper.  Indefinite hypergeometric sums in MACSYMA , 1977 .

[5]  Frank van Harmelen,et al.  Experiments with proof plans for induction , 2004, Journal of Automated Reasoning.

[6]  Dave Barker-Plummer.  Gazing: An approach to the problem of definition and lemma use , 2006, Journal of Automated Reasoning.

[7]  Lawrence S. Kroll.  Mathematica--A System for Doing Mathematics by Computer. , 1989 .

[8]  B. Berndt.  Ramanujan’s Notebooks: Part V , 1997 .

[9]  Robert S. Boyer,et al.  Computational Logic , 1990, ESPRIT Basic Research Series.

[10]  David R. Musser,et al.  The application of a symbolic mathematical system to program verification , 1974, ACM '74.

[11]  Jacques Calmet,et al.  Theorems and algorithms: an interface between Isabelle and Maple , 1995, ISSAC '95.

[12]  Edmund M. Clarke,et al.  Combining Symbolic Computation and Theorem Proving: Some Problems of Ramanujan , 1994, CADE.

[13]  Art Quaife,et al.  Automated deduction in von Neumann-Bernays-Gödel set theory , 1992, Journal of Automated Reasoning.

[14]  Michael J. C. Gordon,et al.  Edinburgh LCF: A mechanised logic of computation , 1979 .

[15]  W. W. Bledsoe,et al.  A Prover for General Inequalities , 1979, IJCAI.

[16]  Patrick Suppes,et al.  An Interactive Calculus Theorem-Prover for Continuity Properties , 1989, J. Symb. Comput..

[17]  Peter B. Andrews.  On connections and higher-order logic , 2004, Journal of Automated Reasoning.

[18]  Melvin Fitting,et al.  First-Order Logic and Automated Theorem Proving , 1990, Graduate Texts in Computer Science.

[19]  R. Fateman,et al.  A System for Doing Mathematics by Computer. , 1992 .

[20]  W. Burnside.  Theory of Functions , 1899, Nature.

[21]  William M. Farmer,et al.  IMPS: An Interactive Mathematical Proof System , 1990, CADE.

[22]  M. Gordon.  HOL : A machine oriented formulation of higher order logic , 1985 .

[23]  Jean H. Gallier,et al.  Logic for Computer Science: Foundations of Automatic Theorem Proving , 1985 .

[24]  John Harrison,et al.  Extending the HOL Theorem Prover with a Computer Algebra System to Reason about the Reals , 1993, HUG.