Sound generalizations in mathematical induction

DOI10.1016/j.tcs.2004.05.022zbMath1078.68141OpenAlexW1986317984MaRDI QIDQ1882908

Emmanuel Kounalis, Pascal Urso

Publication date: 1 October 2004

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2004.05.022

zbMATH Keywords

Automated theorem provingMathematical inductionGeneralizations

Mathematics Subject Classification ID

Related Items

Verifying Procedural Programs via Constrained Rewriting Induction, Determinization of inverted grammar programs via context-free expressions, Correctness of Context-Moving Transformations for Term Rewriting Systems

Cites Work

• Rippling: A heuristic for guiding inductive proofs
• Proofs by induction in equational theories with constructors
• Mechanizing structural induction. II: Strategies
• Automatic proofs by induction in theories without constructors
• Automata-driven automated induction
• Induction using term orders
• Reasoning with conditional axioms
• Lemma discovery in automating induction
• Automated Mathematical Induction
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item