The first-order theory of one-step rewriting is undecidable (Q5055866): Difference between revisions

@@ Property / cites work @@
+Q4846257
@@ Property / cites work: Q4846257 / rank @@
+Normal rank
@@ Property / cites work @@
+Encompassment properties and automata with constraints
+Normal rank
@@ Property / cites work @@
+Q4385532
@@ Property / cites work: Q4385532 / rank @@
+Normal rank
@@ Property / cites work @@
+More problems in rewriting
@@ Property / cites work: More problems in rewriting / rank @@
+Normal rank
@@ Property / cites work @@
+Problems in rewriting III
@@ Property / cites work: Problems in rewriting III / rank @@
+Normal rank
@@ Property / cites work @@
+Q3999206
@@ Property / cites work: Q3999206 / rank @@
+Normal rank
@@ Property / cites work @@
+Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
+Normal rank
@@ Property / cites work @@
+Q5581665
@@ Property / cites work: Q5581665 / rank @@
+Normal rank
@@ Property / cites work @@
+Rewriting techniques and applications. 5th international conference RTA-93, Montréal, Canada, June 16--18, 1993. Proceedings
+Normal rank
@@ Property / cites work @@
+Semantic confluence tests and completion methods
@@ Property / cites work: Semantic confluence tests and completion methods / rank @@
+Normal rank
@@ Property / cites work @@
+A variant of a recursively unsolvable problem
@@ Property / cites work: A variant of a recursively unsolvable problem / rank @@
+Normal rank
@@ Property / cites work @@
+Q4385530
@@ Property / cites work: Q4385530 / rank @@
+Normal rank
@@ Property / cites work @@
+A new method for undecidability proofs of first order theories
+Normal rank
@@ Property / cites work @@
+Q3999156
@@ Property / cites work: Q3999156 / rank @@
+Normal rank