The following pages link to (Q3690200):
Displayed 8 items.
- Reachability analysis over term rewriting systems (Q556686) (← links)
- Tools for proving inductive equalities, relative completeness, and \(\omega\)-completeness (Q582891) (← links)
- Using induction and rewriting to verify and complete parameterized specifications (Q672051) (← links)
- On sufficient-completeness and related properties of term rewriting systems (Q1077161) (← links)
- Automatic inductive theorem proving using Prolog (Q1103415) (← links)
- Narrowing based procedures for equational disunification (Q1197097) (← links)
- Specification and proof in membership equational logic (Q1978640) (← links)
- Sufficient-completeness, ground-reducibility and their complexity (Q2641108) (← links)