The following pages link to (Q4705617):
Displayed 7 items.
- Uncurrying for termination and complexity (Q352959) (← links)
- Relative undecidability in term rewriting. I: The termination hierarchy (Q1854559) (← links)
- Relative undecidability in term rewriting. II: The confluence hierarchy (Q1854560) (← links)
- Right-linear half-monadic term rewrite systems (Q1884902) (← links)
- Termination of term rewriting using dependency pairs (Q1978641) (← links)
- On the Relation between Sized-Types Based Termination and Semantic Labelling (Q3644746) (← links)
- Dummy elimination: Making termination easier (Q5055895) (← links)