The following pages link to Simple termination is difficult (Q1343111):
Displayed 9 items.
- Levels of undecidability in rewriting (Q627134) (← links)
- Proving termination of context-sensitive rewriting by transformation (Q859833) (← links)
- On termination of one rule rewrite systems (Q1334676) (← links)
- On the modularity of termination of term rewriting systems (Q1349693) (← links)
- Simple termination of rewrite systems (Q1392146) (← links)
- Invariants, patterns and weights for ordering terms (Q1581131) (← links)
- Computability of affine non-conditional recurrent systems (Q1606914) (← links)
- Relative undecidability in term rewriting. I: The termination hierarchy (Q1854559) (← links)
- Relative undecidability in term rewriting. II: The confluence hierarchy (Q1854560) (← links)