Pages that link to "Item:Q5055810"
From MaRDI portal
The following pages link to Polynomial time termination and constraint satisfaction tests (Q5055810):
Displaying 9 items.
- Natural termination (Q673622) (← links)
- Perpetual reductions in \(\lambda\)-calculus (Q1286373) (← links)
- Algorithms and reductions for rewriting problems. II. (Q1853144) (← links)
- Perpetuality and uniform normalization in orthogonal rewrite systems (Q1854401) (← links)
- Jumping and escaping: modular termination and the abstract path ordering (Q1929229) (← links)
- (Q4553285) (← links)
- Solving simplification ordering constraints (Q5096318) (← links)
- On the longest perpetual reductions in orthogonal expression reduction systems (Q5958775) (← links)
- First-order theory of rewriting for linear variable-separated rewrite systems: automation, formalization, certification (Q6103588) (← links)
