Sufficient completeness and parameterized proofs by induction
From MaRDI portal
Recommendations
Cited in
(6)- Parameter free induction and provably total computable functions
- The power of parameterization in coinductive proof
- A deduction method complete for refutation and finite satisfiability
- Completeness for parity problems
- Checking Sufficient Completeness by Inductive Theorem Proving
- Using induction and rewriting to verify and complete parameterized specifications
This page was built for publication: Sufficient completeness and parameterized proofs by induction
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4537505)