Pages that link to "Item:Q1099655"
From MaRDI portal
The following pages link to Path of subterms ordering and recursive decomposition ordering revisited (Q1099655):
Displayed 9 items.
- On the complexity of recursive path orderings (Q685537) (← links)
- Termination by completion (Q757069) (← links)
- On the recursive decomposition ordering with lexicographical status and other related orderings (Q912609) (← links)
- Termination proofs by multiset path orderings imply primitive recursive derivation lengths (Q1200982) (← links)
- Simplification orderings: Putting them to the test (Q1311404) (← links)
- An improved general path order (Q1925013) (← links)
- Extensions and comparison of simplification orderings (Q5055737) (← links)
- Time bounded rewrite systems and termination proofs by generalized embedding (Q5055749) (← links)
- Termination proofs by multiset path orderings imply primitive recursive derivation lengths (Q5096206) (← links)