Termination proofs by multiset path orderings imply primitive recursive derivation lengths (Q5096206): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/3-540-53162-9_50
+Normal rank
@@ Property / OpenAlex ID @@
+W4230078282
@@ Property / OpenAlex ID: W4230078282 / rank @@
+Normal rank
@@ Property / cites work @@
+Computability, complexity, logic. Transl. from the German
+Normal rank
@@ Property / cites work @@
+Orderings for term-rewriting systems
@@ Property / cites work: Orderings for term-rewriting systems / rank @@
+Normal rank
@@ Property / cites work @@
+Termination of rewriting
@@ Property / cites work: Termination of rewriting / rank @@
+Normal rank
@@ Property / cites work @@
+Q4385532
@@ Property / cites work: Q4385532 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3819993
@@ Property / cites work: Q3819993 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3659124
@@ Property / cites work: Q3659124 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3817590
@@ Property / cites work: Q3817590 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3683533
@@ Property / cites work: Q3683533 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3325707
@@ Property / cites work: Q3325707 / rank @@
+Normal rank
@@ Property / cites work @@
+Path of subterms ordering and recursive decomposition ordering revisited
+Normal rank
@@ Property / cites work @@
+Extensions and comparison of simplification orderings
+Normal rank