Automated Mathematical Induction
From MaRDI portal
Recommendations
Cited in
(20)- Formal design and verification of operational transformation algorithms for copies convergence
- Rule-based induction
- Automated mathematical induction
- scientific article; zbMATH DE number 907678 (Why is no real title available?)
- A divergence critic
- On notions of inductive validity for first-order equational clauses
- Improving rewriting induction approach for proving ground confluence
- Sound generalizations in mathematical induction
- Using induction and rewriting to verify and complete parameterized specifications
- Induction models on \(\mathbb{N}\)
- Automated Certification of Implicit Induction Proofs
- Automata-driven automated induction
- Implicit induction in conditional theories
- Combining Rewriting with Noetherian Induction to Reason on Non-orientable Equalities
- Correctness of Context-Moving Transformations for Term Rewriting Systems
- A unified view of induction reasoning for first-order logic
- scientific article; zbMATH DE number 3898269 (Why is no real title available?)
- Test sets for the universal and existential closure of regular tree languages.
- Mechanically certifying formula-based Noetherian induction reasoning
- A general framework to build contextual cover set induction provers
This page was built for publication: Automated Mathematical Induction
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4849648)