The $\Pi^0_2$ -Completeness of Most of the Properties of Rewriting Systems You Care About (and Productivity) (Q3636833): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/978-3-642-02348-4_24
+Normal rank
@@ Property / OpenAlex ID @@
+W1505655634
@@ Property / OpenAlex ID: W1505655634 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3900995
@@ Property / cites work: Q3900995 / rank @@
+Normal rank
@@ Property / cites work @@
+Term Rewriting and All That
@@ Property / cites work: Term Rewriting and All That / rank @@
+Normal rank
@@ Property / cites work @@
+A term calculus for (co-)recursive definitions on streamlike data structures
+Normal rank
@@ Property / cites work @@
+Decidability of the confluence of finite ground term rewrite systems and of other related term rewrite systems
+Normal rank
@@ Property / cites work @@
+Data-Oblivious Stream Productivity
@@ Property / cites work: Data-Oblivious Stream Productivity / rank @@
+Normal rank
@@ Property / cites work @@
+Productivity of Stream Definitions
@@ Property / cites work: Productivity of Stream Definitions / rank @@
+Normal rank
@@ Property / cites work @@
+Strong Computability and Variants of the Uniform Halting Problem
+Normal rank
@@ Property / cites work @@
+The Church-Rosser property for ground term-rewriting systems is decidable
+Normal rank
@@ Property / cites work @@
+Equality of streams is a Π0 over 2-complete problem
+Normal rank
@@ Property / cites work @@
+Q3392275
@@ Property / cites work: Q3392275 / rank @@
+Normal rank