The following pages link to (Q3696501):
Displaying 5 items.
- Automating the Knuth Bendix ordering (Q751830) (← links)
- Termination orderings for associative-commutative rewriting systems (Q1072371) (← links)
- Termination of rewriting (Q1098624) (← links)
- History and basic features of the critical-pair/completion procedure (Q1103414) (← links)
- Proving termination of (conditional) rewrite systems. A semantic approach (Q1323317) (← links)
