The following pages link to (Q4846999):
Displaying 13 items.
- Natural termination (Q673622) (← links)
- Proving termination of context-sensitive rewriting by transformation (Q859833) (← links)
- Termination of just/fair computations in term rewriting (Q924727) (← links)
- Loop detection in term rewriting using the eliminating unfoldings (Q944383) (← links)
- Termination of narrowing via termination of rewriting (Q969619) (← links)
- Simple termination of rewrite systems (Q1392146) (← links)
- Invariants, patterns and weights for ordering terms (Q1581131) (← links)
- Modular termination proofs for rewriting using dependency pairs (Q1864874) (← links)
- Termination of term rewriting using dependency pairs (Q1978641) (← links)
- Termination analysis for partial functions (Q5030190) (← links)
- Extensions and comparison of simplification orderings (Q5055737) (← links)
- Termination of constructor systems (Q5055852) (← links)
- Polynomials over the reals in proofs of termination : from theory to practice (Q5313720) (← links)
