Relative undecidability in term rewriting. I: The termination hierarchy (Q1854559): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1006/inco.2002.3120
+Normal rank
@@ Property / OpenAlex ID @@
+W2312503573
@@ Property / OpenAlex ID: W2312503573 / 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 @@
+Q4263809
@@ Property / cites work: Q4263809 / rank @@
+Normal rank
@@ Property / cites work @@
+Simulation of Turing machines by a regular rewrite rule
+Normal rank
@@ Property / cites work @@
+Total termination of term rewriting
@@ Property / cites work: Total termination of term rewriting / rank @@
+Normal rank
@@ Property / cites work @@
+Omega-termination is undecidable for totally terminating term rewriting systems
+Normal rank
@@ Property / cites work @@
+Relative undecidability in term rewriting. II: The confluence hierarchy
+Normal rank
@@ Property / cites work @@
+Q4362915
@@ Property / cites work: Q4362915 / rank @@
+Normal rank
@@ Property / cites work @@
+Well-Quasi-Ordering, The Tree Theorem, and Vazsonyi's Conjecture
+Normal rank
@@ Property / cites work @@
+On termination of one rule rewrite systems
@@ Property / cites work: On termination of one rule rewrite systems / rank @@
+Normal rank
@@ Property / cites work @@
+Q4225065
@@ Property / cites work: Q4225065 / rank @@
+Normal rank
@@ Property / cites work @@
+The order types of termination orderings on monadic terms, strings and multisets
+Normal rank
@@ Property / cites work @@
+Simple termination is difficult
@@ Property / cites work: Simple termination is difficult / rank @@
+Normal rank
@@ Property / cites work @@
+Q4705617
@@ Property / cites work: Q4705617 / rank @@
+Normal rank
@@ Property / cites work @@
+Simple termination of rewrite systems
@@ Property / cites work: Simple termination of rewrite systems / rank @@
+Normal rank
@@ Property / cites work @@
+The undecidability of self-embedding for term rewriting systems
+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 @@
+Termination of term rewriting: Interpretation and type elimination
+Normal rank
@@ Property / cites work @@
+Total termination of term rewriting is undecidable
+Normal rank
@@ Property / cites work @@
+Non-Looping String Rewriting
@@ Property / cites work: Non-Looping String Rewriting / rank @@
+Normal rank