Abstract
This paper reports a case study in the use of proof planning in the context of higher order syntax. Rippling is a heuristic for guiding rewriting steps in induction that has been used successfully in proof planning inductive proofs using first order representations. Ordinal arithmetic provides a natural set of higher order examples on which transfinite induction may be attempted using rippling. Previously Boyer-Moore style automation could not be applied to such domains. We demonstrate that a higher-order extension of the rippling heuristic is sufficient to plan such proofs automatically. Accordingly, ordinal arithmetic has been implemented in λClam, a higher order proof planning system for induction, and standard undergraduate text book problems have been successfully planned. We show the synthesis of a fixpoint for normal ordinal functions which demonstrates how our automation could be extended to produce more interesting results than the textbook examples tried so far.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
F. Baader and T. Nipkow. Term Rewriting and All That. Cambridge University Press, 1998.
David Basin and Toby Walsh. A calculus for and termination of rippling. Journal of Automated Reasoning, 16(1–2):147–180, 1996.
R. S. Boyer and J S. Moore. A Computational Logic Handbook. Academic Press, 1988. Perspectives in Computing, Vol 23.
A. Bundy. The use of explicit plans to guide inductive proofs. In R. Lusk and R. Overbeek, editors, 9th International Conference on Automated Deduction, pages 111–120. Springer-Verlag, 1988. Longer version available from Edinburgh as DAI Research Paper No. 349.
A. Bundy, A. Stevens, F. van Harmelen, A. Ireland, and A. Smaill. Rippling: A heuristic for guiding inductive proofs. Artificial Intelligence, 62:185–253, 1993. Also available from Edinburgh as DAI Research Paper No. 567.
Alan Bundy. The automation of proof by mathematical induction. In A. Robinson and A. Voronkov, editors, Handbook of Automated Reasoning. Elsevier., 1998. Forthcoming.
A. Cichon and H. Touzet. An ordinal calculus for proving termination in term rewriting. In Proceedings of CAAP’96, Coll. on Trees in Algebra and Programming, number 1059 in Lecture Notes in Computer Science. Springer, 1996.
Th. Coquand. Une Théorie des Constructions. PhD thesis, University of Paris VII, 1985.
Herbert B. Enderton. Elements of Set Theory. Academic Press, 1977.
W. M. Farmer, J. D. Guttman, and F. J. Thayer. IMPS: an interactive mathematical proof system. Journal of Automated Reasoning, 9(11):213–248, 1993.
A. Felty. A logic programming approach to implementing higher-order term rewriting. In L-H Eriksson et al., editors, Second International Workshop on Extensions to Logic Programming, volume 596 of Lecture Notes in Artificial Intelligence, pages 135–61. Springer-Verlag, 1992.
Lego group. Lego home page. http://www.dcs.ed.ac.uk/home/lego/.
P. Halmos. Naive Set Theory. Van Nostrand, Princeton, NJ, 1960.
A. G. Hamilton. Numbers, sets and axioms: the apparatus of mathematics. Cambridge University Press, 1982.
Jean-Pierre Jouannaud and Mitsuhiro Okada. Satisfiability of systems of ordinal notations with the subterm property is decidable. In Proceedings of the Eighteenth EATCS Colloquium on Automata, Languages and Programming, Madrid, Spain, 1991.
S. Owre, J. M. Rushby, and N. Shankar. PVS: An integrated approach to specification and verification. Tech report, SRI International, 1992.
L.C. Paulson. Set theory for verification: II. induction and recursion. Journal of Automated Reasoning, 15:353–389, 1995.
L.C. Paulson and K. Grabczewski. Mechanizing set theory: cardinal arithmetic and the axiom of choice. Journal of Automated Reasoning, pages 291–323, 1996.
J.D.C Richardson, A. Smaill, and Ian Green. System description: proof planning in higher-order logic with LambdaCLAM. In Claude Kirchner and Hélène Kirchner, editors, 15th International Conference on Automated Deduction, volume 1421 of Lecture Notes in Artificial Intelligence, pages 129–133, Lindau, Germany, July 1998.
Alan Smaill and Ian Green. Higher-order annotated terms for proof search. In Joakim von Wright, Jim Grundy, and John Harrison, editors, Theorem Proving in Higher Order Logics: 9th International Conference, TPHOLs’96, volume 1275 of Lecture Notes in Computer Science, pages 399–414, Turku, Finland, 1996. Springer-Verlag. Also available as DAI Research Paper 799.
P. Suppes. Axiomatic Set Theory. Van Nostrand, Princeton, NJ, 1960.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Dennis, L.A., Smaill, A. (2001). Ordinal Arithmetic: A Case Study for Rippling in a Higher Order Domain. In: Boulton, R.J., Jackson, P.B. (eds) Theorem Proving in Higher Order Logics. TPHOLs 2001. Lecture Notes in Computer Science, vol 2152. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44755-5_14
Download citation
DOI: https://doi.org/10.1007/3-540-44755-5_14
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42525-0
Online ISBN: 978-3-540-44755-9
eBook Packages: Springer Book Archive