Pages that link to "Item:Q1805401"
From MaRDI portal
The following pages link to Termination of rewrite systems by elementary interpretations (Q1805401):
Displaying 11 items.
- Beyond polynomials and Peano arithmetic -- automation of elementary and ordinal interpretations (Q485843) (← links)
- Termination of rewriting systems by polynomial interpretations and its implementation (Q579930) (← links)
- Mechanically proving termination using polynomial interpretations (Q851142) (← links)
- Innermost termination of rewrite systems by labeling (Q2873673) (← links)
- Preuves de terminaison de systèmes de réécriture fondées sur les interprétations polynomiales. Une méthode basée sur le théorème de Sturm (Q3357550) (← links)
- More problems in rewriting (Q5055812) (← links)
- Automatic Proofs of Termination With Elementary Interpretations (Q5170190) (← links)
- Computer Science Logic (Q5311249) (← links)
- Termination of term rewriting by interpretation (Q5881183) (← links)
- A survey of ordinal interpretations of type ɛ0 for termination of rewriting systems (Q5881273) (← links)
- Termination proofs for ground rewrite systems -- interpretations and derivational complexity (Q5941752) (← links)