Computing induction axioms
- 9 June 2005
- book chapter
- Published by Springer Nature
- p. 381-392
- https://doi.org/10.1007/bfb0013076
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Argument-bounded algorithms as a basis for automated termination proofsPublished by Springer Nature ,2005
- Disproving conjecturesPublished by Springer Nature ,1992
- Term rewriting inductionPublished by Springer Nature ,1990
- Proof by consistencyArtificial Intelligence, 1987
- The karlsruhe induction theorem proving systemPublished by Springer Nature ,1986
- Mechanizing structural induction part I: Formal systemTheoretical Computer Science, 1979
- Proving Theorems about LISP FunctionsJournal of the ACM, 1975
- Proving Properties of Programs by Structural InductionThe Computer Journal, 1969