Pages that link to "Item:Q1355781"
From MaRDI portal
The following pages link to Omega-termination is undecidable for totally terminating term rewriting systems (Q1355781):
Displaying 7 items.
- An intuitionistic version of Ramsey's theorem and its use in program termination (Q499082) (← links)
- Levels of undecidability in rewriting (Q627134) (← links)
- Relative undecidability in term rewriting. I: The termination hierarchy (Q1854559) (← links)
- Relative undecidability in term rewriting. II: The confluence hierarchy (Q1854560) (← links)
- Total termination of term rewriting is undecidable (Q1911402) (← links)
- (Q3773856) (← links)
- Termination proofs for ground rewrite systems -- interpretations and derivational complexity (Q5941752) (← links)