Automatic generation of epsilon-Delta proofs of continuity

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1476, Issue , 1998, Pages 67-83

  Beeson, Michael ^a  

^a SAN JOSE STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; CALCULATIONS; COMPUTER CIRCUITS;

AUTOMATIC GENERATION; CONTROL MECHANISM; UNIFORM CONTINUITY;

COMPUTATION THEORY;

EID: 84961341105     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0055903     Document Type: Conference Paper

References (16)

1. Beeson, M.: Logic and computation in Mathpert: an expert system for learning mathematics, in: Kaltofen, E., and Watt, S. M. (eds.), Computers and Mathematics, pp. 202-214, Springer-Verlag (1989).
2. Beeson, M.: Design Principles of Mathpert: Software to support education in algebra and calculus, in: Kajler, N. (ed.) Human Interfaces to Symbolic Computation, Springer-Verlag, Berlin/ Heidelberg/ New York (1996).
3. Beeson, M.: Using nonstandard analysis to ensure the correctness of symbolic computations, International Journal of Foundations of Computer Science 6(3) (1995) 299-338.
4. Beeson, M.: Some applications of Gentzen's proof theory in automated deduction, in: Shroeder-Heister, P., Extensions of Logic Programming, Springer Lecture Notes in Computer Science 475, pp. 101-156, Springer-Verlag (1991).
5. Beeson, M.: Unification in lambda-calculus, to appear in Automated Deduction: CADE-15 - Proc. of the 15th International Conference on Automated Deduction, Springer-Verlag, Berlin/Heidelberg (1998).
6. Bledsoe, W. W.: Some automatic proofs in analysis, pp. 89-118 in: W. Bledsoe and D. Loveland (eds.) Automoated Theorem Proving: After 25 Years, volume 29 in the Contemporary Mathematics series, AMS, Providence, R. I. (1984).
7. Boyer, R., and Moore, J.: A Computational Logic, Academic Press (1979).
8. Buchberger, B.: History and basic features of the critical-pair completeion procedure, J. Symbolic Computation 3:3-88 (1987).
9. Clarke, E., and Zhao, X.: Analytica: A Theorem Prover in Mathematica, in: Kapur, D. (ed.), Automated Deduction: CADE-11 - Proc. of the 11th International Conference on Automated Deduction, pp. 761-765, Springer-Verlag, Berlin/Heidelberg (1992).
10. Coste, M., and Roy, M. F.: Thom's lemma, the coding of real algebraic numbers, and the computation of the topology of semi-algebraic sets, in: Arnon, D. S., and Buchberger, B., Algorithms in Real Algebraic Geometry, Academic Press, London (1988).
11. Harrison, J., and Thery, L.: Extending the HOL theorem prover with a computer algebra system to reason about the reals, in Higher Order Logic Theorem Proving and its Applications: 6th International Workshop, HUG '93, pp. 174-184, Lecture Notes in Computer Science 780, Springer-Verlag (1993).
12. Kleene, S. C., Introduction to Metamathematics, van Nostrand, Princeton, N. J. (1952).
13. McCune, W.: Otter 2.0, in: Stickel, M. E. (ed.), 10th International Conference on Automated Deduction pp. 663-664, Springer-Verlag, Berlin/Heidelberg (1990).
14. Richardson, D., Some unsolvable problems involving elementary functions of a real variable, J. Symbolic Logic 33 511-520 (1968).
15. Stoutemeyer, R.: Crimes and misdemeanors in the computer algebra trade, Notices of the A.M.S 38(7) 779-785, September 1991.
16. Wu Wen-Tsum: Basic principles of mechanical theorem-proving in elementary geometries, J. Automated Reasoning 2 221-252, 1986.