Pages that link to "Item:Q1392146"
From MaRDI portal
The following pages link to Simple termination of rewrite systems (Q1392146):
Displaying 13 items.
- Simple termination is difficult (Q1343111) (← links)
- Pattern-matching algorithms based on term rewrite systems (Q1575262) (← links)
- Relative undecidability in term rewriting. I: The termination hierarchy (Q1854559) (← links)
- Relative undecidability in term rewriting. II: The confluence hierarchy (Q1854560) (← links)
- Modular termination proofs for rewriting using dependency pairs (Q1864874) (← links)
- Modularity in term rewriting revisited (Q1929227) (← links)
- Termination of term rewriting using dependency pairs (Q1978641) (← links)
- Certified Kruskal’s Tree Theorem (Q2938047) (← links)
- Termination Proof of S-Expression Rewriting Systems with Recursive Path Relations (Q3522031) (← links)
- AC-KBO revisited (Q4593023) (← links)
- (Q5009706) (← links)
- (Q5015375) (← links)
- Simple termination is difficult (Q5055798) (← links)