Pages that link to "Item:Q5096206"

The following pages link to Termination proofs by multiset path orderings imply primitive recursive derivation lengths (Q5096206):

Displaying 13 items.

• Termination proofs for term rewriting systems by lexicographic path orderings imply multiply recursive derivation lengths (Q673975) (← links)
• Term rewriting theory for the primitive recursive functions (Q674412) (← links)
• Termination proofs by multiset path orderings imply primitive recursive derivation lengths (Q1200982) (← links)
• Bounding derivation lengths with functions from the slow growing hierarchy (Q1267850) (← links)
• Some results on cut-elimination, provable well-orderings, induction and reflection (Q1295413) (← links)
• Proof-theoretic analysis of termination proofs (Q1899143) (← links)
• Proving Termination Using Recursive Path Orders and SAT Solving (Q3525016) (← links)
• (Q5014441) (← links)
• Termination proofs and the length of derivations (Q5055719) (← links)
• Incremental termination proofs and the length of derivations (Q5055748) (← links)
• Time bounded rewrite systems and termination proofs by generalized embedding (Q5055749) (← links)
• Termination of term rewriting by interpretation (Q5881183) (← links)
• Analyzing Innermost Runtime Complexity Through Tuple Interpretations (Q6118746) (← links)