Degrees of Undecidability in Term Rewriting (Q3644753): Difference between revisions

@@ Property / cites work @@
+Q4520528
@@ Property / cites work: Q4520528 / rank @@
+Normal rank
@@ Property / cites work @@
+Termination of term rewriting using dependency pairs
+Normal rank
@@ Property / cites work @@
+Degrees of Undecidability in Term Rewriting
@@ Property / cites work: Degrees of Undecidability in Term Rewriting / rank @@
+Normal rank
@@ Property / cites work @@
+Automated Termination Analysis for Haskell: From Term Rewriting to Programming Languages
+Normal rank
@@ Property / cites work @@
+Logic for Programming, Artificial Intelligence, and Reasoning
+Normal rank
@@ Property / cites work @@
+Q4146722
@@ Property / cites work: Q4146722 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5573961
@@ Property / cites work: Q5573961 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3012528
@@ Property / cites work: Q3012528 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5537599
@@ Property / cites work: Q5537599 / rank @@
+Normal rank
@@ Property / cites work @@
+The $\Pi^0_2$ -Completeness of Most of the Properties of Rewriting Systems You Care About (and Productivity)
+Normal rank
@@ Property / cites work @@
+Normalization of Infinite Terms
@@ Property / cites work: Normalization of Infinite Terms / rank @@
+Normal rank