Pages that link to "Item:Q1912706"

The following pages link to Total termination of term rewriting (Q1912706):

Displaying 17 items.

• Termination of term rewriting: Interpretation and type elimination (Q1332336) (← links)
• A proof of strongly uniform termination for Gödel's \(T\) by methods from local predicativity (Q1374676) (← links)
• Termination modulo equations by abstract commutation with an application to iteration (Q1391793) (← links)
• Simple termination of rewrite systems (Q1392146) (← links)
• Relative undecidability in term rewriting. I: The termination hierarchy (Q1854559) (← links)
• Relative undecidability in term rewriting. II: The confluence hierarchy (Q1854560) (← links)
• Proof-theoretic analysis of termination proofs (Q1899143) (← links)
• Total termination of term rewriting is undecidable (Q1911402) (← links)
• Total termination of term rewriting (Q1912706) (← links)
• (Q4219044) (← links)
• The order types of termination orderings on monadic terms, strings and multisets (Q4358058) (← links)
• Checking termination of bottom-up evaluation of logic programs with function symbols (Q4593017) (← links)
• Using linear constraints for logic program termination analysis (Q4593032) (← links)
• Total termination of term rewriting (Q5055796) (← links)
• Computer Science Logic (Q5311249) (← links)
• Logic programming with function symbols: Checking termination of bottom-up evaluation through program adornments (Q5398308) (← links)
• Termination proofs for ground rewrite systems -- interpretations and derivational complexity (Q5941752) (← links)