The following pages link to Automated Mathematical Induction (Q4849648):
Displaying 12 items.
- Mechanically certifying formula-based Noetherian induction reasoning (Q507366) (← links)
- Using induction and rewriting to verify and complete parameterized specifications (Q672051) (← links)
- Formal design and verification of operational transformation algorithms for copies convergence (Q820129) (← links)
- Test sets for the universal and existential closure of regular tree languages. (Q1400712) (← links)
- Sound generalizations in mathematical induction (Q1882908) (← links)
- Implicit induction in conditional theories (Q1891255) (← links)
- Automated Certification of Implicit Induction Proofs (Q3100200) (← links)
- Combining Rewriting with Noetherian Induction to Reason on Non-orientable Equalities (Q3522029) (← links)
- Improving rewriting induction approach for proving ground confluence (Q5111302) (← links)
- On notions of inductive validity for first-order equational clauses (Q5210769) (← links)
- Correctness of Context-Moving Transformations for Term Rewriting Systems (Q5743602) (← links)
- A general framework to build contextual cover set induction provers (Q5950934) (← links)
