The following pages link to Termination by completion (Q757069):
Displaying 16 items.
- Abstract abstract reduction (Q817587) (← links)
- Termination modulo equations by abstract commutation with an application to iteration (Q1391793) (← links)
- Termination of rewrite systems by elementary interpretations (Q1805401) (← links)
- Proof of termination of the rewriting system SUBSET on CCL (Q1822494) (← links)
- An improved general path order (Q1925013) (← links)
- Jumping and escaping: modular termination and the abstract path ordering (Q1929229) (← links)
- Termination of term rewriting using dependency pairs (Q1978641) (← links)
- Automating the dependency pair method (Q2486583) (← links)
- Finding small counterexamples for abstract rewriting properties (Q4585013) (← links)
- Transforming termination by self-labelling (Q4647535) (← links)
- Program transformation and rewriting (Q5055762) (← links)
- Automatic termination proofs with transformation orderings (Q5055814) (← links)
- A complete characterization of termination of 0p 1q→1r 0s (Q5055817) (← links)
- Termination of constructor systems (Q5055852) (← links)
- Dummy elimination in equational rewriting (Q5055853) (← links)
- Dummy elimination: Making termination easier (Q5055895) (← links)
