Abstract
As part of a project on automatic generation of proofs involving both logic and computation, we have automated the production of some proofs involving epsilon-delta arguments. These proofs involve two or three quantifiers on the logical side, and on the computational side, they involve algebra, trigonometry, and some calculus. At the border of logic and computation, they involve several types of arguments involving inequalities, including transitivity chaining and several types of bounding arguments, in which bounds are sought that do not depend on certain variables. Control mechanisms have been developed for intermixing logical deduction steps with computational steps and with inequality reasoning. Problems discussed here as examples involve the continuity and uniform continuity of various specific functions.
Keywords
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.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
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).
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).
Beeson, M.: Using nonstandard analysis to ensure the correctness of symbolic computations, International Journal of Foundations of Computer Science 6(3) (1995) 299–338.
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).
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).
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).
Boyer, R., and Moore, J.: A Computational Logic, Academic Press (1979).
Buchberger, B.: History and basic features of the critical-pair completeion procedure, J. Symbolic Computation 3:3–88 (1987).
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).
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).
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).
Kleene, S. C., Introduction to Metamathematics, van Nostrand, Princeton, N. J. (1952).
McCune, W.: Otter 2.0, in: Stickel, M. E. (ed.), 10th International Conference on Automated Deduction pp. 663–664, Springer-Verlag, Berlin/Heidelberg (1990).
Richardson, D., Some unsolvable problems involving elementary functions of a real variable, J. Symbolic Logic 33 511–520 (1968).
Stoutemeyer, R.: Crimes and misdemeanors in the computer algebra trade, Notices of the A.M.S 38(7) 779–785, September 1991.
Wu Wen-Tsum: Basic principles of mechanical theorem-proving in elementary geometries, J. Automated Reasoning 2 221–252, 1986.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Beeson, M. (1998). Automatic generation of epsilon-delta proofs of continuity. In: Calmet, J., Plaza, J. (eds) Artificial Intelligence and Symbolic Computation. AISC 1998. Lecture Notes in Computer Science, vol 1476. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0055903
Download citation
DOI: https://doi.org/10.1007/BFb0055903
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-64960-1
Online ISBN: 978-3-540-49816-2
eBook Packages: Springer Book Archive