The following pages link to (Q3785921):
Displayed 9 items.
- Reachability analysis over term rewriting systems (Q556686) (← links)
- Matching - a special case of unification? (Q582272) (← 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)
- Equational problems and disunification (Q1124372) (← links)
- Automatic proofs by induction in theories without constructors (Q1824382) (← links)
- Specification and proof in membership equational logic (Q1978640) (← links)
- Sufficient-completeness, ground-reducibility and their complexity (Q2641108) (← links)