Pages that link to "Item:Q5941751"
From MaRDI portal
The following pages link to The termination hierarchy for term rewriting (Q5941751):
Displaying 18 items.
- Domain expansion for ASP-programs with external sources (Q254002) (← links)
- Beyond polynomials and Peano arithmetic -- automation of elementary and ordinal interpretations (Q485843) (← links)
- Term rewriting: Some experimental results (Q757071) (← links)
- Termination of just/fair computations in term rewriting (Q924727) (← links)
- Adding constants to string rewriting (Q945008) (← links)
- Match-bounded string rewriting systems (Q1762560) (← links)
- Relative undecidability in term rewriting. I: The termination hierarchy (Q1854559) (← links)
- Total termination of term rewriting (Q1912706) (← links)
- Multi-dimensional interpretations for termination of term rewriting (Q2055861) (← links)
- Tuple interpretations for termination of term rewriting (Q2102931) (← links)
- Term orderings for non-reachability of (conditional) rewriting (Q2104512) (← links)
- Terminal embeddings (Q2405893) (← links)
- Innermost termination of rewrite systems by labeling (Q2873673) (← links)
- (Q4799892) (← links)
- Decreasing diagrams with two labels are complete for confluence of countable systems (Q4993340) (← links)
- A local termination property for term rewriting systems (Q5055724) (← links)
- Computer Science Logic (Q5311249) (← links)
- Termination of Fair Computations in Term Rewriting (Q5387839) (← links)