The following pages link to (Q3696498):
Displayed 10 items.
- Linearizing well quasi-orders and bounding the length of bad sequences (Q744984) (← links)
- Automating the Knuth Bendix ordering (Q751830) (← links)
- On the recursive decomposition ordering with lexicographical status and other related orderings (Q912609) (← links)
- Rewriting with a nondeterministic choice operator (Q1096383) (← links)
- Termination of rewriting (Q1098624) (← links)
- Simplifying conditional term rewriting systems: Unification, termination and confluence (Q1100891) (← links)
- History and basic features of the critical-pair/completion procedure (Q1103414) (← links)
- Well rewrite orderings and well quasi-orderings (Q1209622) (← links)
- Orienting rewrite rules with the Knuth-Bendix order. (Q1401932) (← links)
- An overview of LP, the Larch Prover (Q5055717) (← links)