Levels of undecidability in rewriting (Q627134): 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 @@
+Conditional rewrite rules: Confluence and termination
+Normal rank
@@ Property / cites work @@
+THE WORD PROBLEM
@@ Property / cites work: THE WORD PROBLEM / rank @@
+Normal rank
@@ Property / cites work @@
+Q3795205
@@ Property / cites work: Q3795205 / rank @@
+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 @@
+Degrees of Undecidability in Term Rewriting
@@ Property / cites work: Degrees of Undecidability in Term Rewriting / rank @@
+Normal rank
@@ Property / cites work @@
+Models of computation. An introduction to computability theory
+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. I: The termination hierarchy
+Normal rank
@@ Property / cites work @@
+Relative undecidability in term rewriting. II: The confluence hierarchy
+Normal rank
@@ Property / cites work @@
+Logic for Programming, Artificial Intelligence, and Reasoning
+Normal rank
@@ Property / cites work @@
+Strong Computability and Variants of the Uniform Halting Problem
+Normal rank
@@ Property / cites work @@
+Q4146722
@@ Property / cites work: Q4146722 / rank @@
+Normal rank
@@ Property / cites work @@
+Decidable approximations of term rewriting systems
+Normal rank
@@ Property / cites work @@
+Reachability and confluence are undecidable for flat term rewriting systems
+Normal rank
@@ Property / cites work @@
+Conditional rewrite rules
@@ Property / cites work: Conditional rewrite rules / rank @@
+Normal rank
@@ Property / cites work @@
+Undecidable properties of syntactic theories
@@ Property / cites work: Undecidable properties of syntactic theories / rank @@
+Normal rank
@@ Property / cites work @@
+Recursive Predicates and Quantifiers
@@ Property / cites work: Recursive Predicates and Quantifiers / rank @@
+Normal rank
@@ Property / cites work @@
+Arithmetical Predicates and Function Quantifiers
@@ Property / cites work: Arithmetical Predicates and Function Quantifiers / rank @@
+Normal rank
@@ Property / cites work @@
+Hierarchies of number-theoretic predicates
@@ Property / cites work: Hierarchies of number-theoretic predicates / rank @@
+Normal rank
@@ Property / cites work @@
+Q4023825
@@ Property / cites work: Q4023825 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3012528
@@ Property / cites work: Q3012528 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4942157
@@ Property / cites work: Q4942157 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5583066
@@ Property / cites work: Q5583066 / rank @@
+Normal rank
@@ Property / cites work @@
+Simple termination is difficult
@@ Property / cites work: Simple termination is difficult / rank @@
+Normal rank
@@ Property / cites work @@
+Decidability for left-linear growing term rewriting systems.
+Normal rank
@@ Property / cites work @@
+Q5573961
@@ Property / cites work: Q5573961 / 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 @@
+Q3392275
@@ Property / cites work: Q3392275 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4799892
@@ Property / cites work: Q4799892 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4938608
@@ Property / cites work: Q4938608 / rank @@
+Normal rank
@@ Property / cites work @@
+A new decidability technique for ground term rewriting systems with applications
+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 @@
+Normalization of Infinite Terms
@@ Property / cites work: Normalization of Infinite Terms / rank @@
+Normal rank