The following pages link to (Q4783327):
Displaying 6 items.
- Proving weak properties of rewriting (Q554217) (← links)
- Jumping and escaping: modular termination and the abstract path ordering (Q1929229) (← links)
- Dependent choice as a termination principle (Q2309508) (← links)
- On the Computational Content of Termination Proofs (Q3195706) (← links)
- Termination Proof of S-Expression Rewriting Systems with Recursive Path Relations (Q3522031) (← links)
- The Computability Path Ordering: The End of a Quest (Q3540166) (← links)
