Pages that link to "Item:Q1911402"
From MaRDI portal
The following pages link to Total termination of term rewriting is undecidable (Q1911402):
Displaying 12 items.
- Levels of undecidability in rewriting (Q627134) (← links)
- Undecidable properties of flat term rewrite systems (Q734041) (← links)
- The undecidability of self-embedding for term rewriting systems (Q1061484) (← links)
- Omega-termination is undecidable for totally terminating term rewriting systems (Q1355781) (← links)
- Simple termination of rewrite systems (Q1392146) (← 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 (Q1912706) (← links)
- Decidability of innermost termination and context-sensitive termination for semi-constructor term rewriting systems (Q2873675) (← links)
- Problems in rewriting III (Q5055847) (← links)
- Polynomials over the reals in proofs of termination : from theory to practice (Q5313720) (← links)
- Termination Tools in Ordered Completion (Q5747788) (← links)