On proving termination by innermost termination (Q5055854): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/3-540-61464-8_45
+Normal rank
@@ Property / OpenAlex ID @@
+W1586360976
@@ Property / OpenAlex ID: W1586360976 / rank @@
+Normal rank
@@ Property / cites work @@
+Natural termination
@@ Property / cites work: Natural termination / rank @@
+Normal rank
@@ Property / cites work @@
+Q4385532
@@ Property / cites work: Q4385532 / rank @@
+Normal rank
@@ Property / cites work @@
+Generalized sufficient conditions for modular termination of rewriting
+Normal rank
@@ Property / cites work @@
+On termination and confluence properties of disjoint and constructor-sharing conditional rewrite systems
+Normal rank
@@ Property / cites work @@
+Only prime superpositions need be considered in the Knuth-Bendix completion procedure
+Normal rank
@@ Property / cites work @@
+Modular proofs for completeness of hierarchical term rewriting systems
+Normal rank
@@ Property / cites work @@
+Modularity of simple termination of term rewriting systems with shared constructors
+Normal rank
@@ Property / cites work @@
+Completeness of combinations of constructor systems
+Normal rank
@@ Property / cites work @@
+On theories with a combinatorial definition of 'equivalence'
+Normal rank
@@ Property / cites work @@
+On the modularity of termination of term rewriting systems
+Normal rank
@@ Property / cites work @@
+Modular termination of \(r\)-consistent and left-linear term rewriting systems
+Normal rank
@@ Property / cites work @@
+On the Church-Rosser property for the direct sum of term rewriting systems
+Normal rank
@@ Property / cites work @@
+Termination for the direct sum of left-linear term rewriting systems
+Normal rank