Termination proofs for term rewriting systems by lexicographic path orderings imply multiply recursive derivation lengths (Q673975): Difference between revisions

@@ Property / cites work @@
+A Uniform Approach to Fundamental Sequences and Hierarchies
+Normal rank
@@ Property / cites work @@
+Q3138831
@@ Property / cites work: Q3138831 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4385532
@@ Property / cites work: Q4385532 / rank @@
+Normal rank
@@ Property / cites work @@
+Incremental termination proofs and the length of derivations
+Normal rank
@@ Property / cites work @@
+Termination proofs by multiset path orderings imply primitive recursive derivation lengths
+Normal rank
@@ Property / cites work @@
+Q3773877
@@ Property / cites work: Q3773877 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3325707
@@ Property / cites work: Q3325707 / rank @@
+Normal rank
@@ Property / cites work @@
+Eine Klassifikation der ε<sub>0</sub>‐Rekursiven Funktionen
+Normal rank
@@ Property / cites work @@
+Q4143279
@@ Property / cites work: Q4143279 / rank @@
+Normal rank
@@ Property / cites work @@
+Slow growing versus fast growing
@@ Property / cites work: Slow growing versus fast growing / rank @@
+Normal rank
@@ Property / cites work @@
+Bounding derivation lengths with functions from the slow growing hierarchy
+Normal rank