Proving equational and inductive theorems by completion and embedding techniques (Q5055774): 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.1007/3-540-53904-2_110
+Normal rank
@@ Property / OpenAlex ID @@
+W1606155280
@@ Property / OpenAlex ID: W1606155280 / rank @@
+Normal rank
@@ Property / cites work @@
+Completion for rewriting modulo a congruence
@@ Property / cites work: Completion for rewriting modulo a congruence / rank @@
+Normal rank
@@ Property / cites work @@
+Termination of rewriting
@@ Property / cites work: Termination of rewriting / rank @@
+Normal rank
@@ Property / cites work @@
+Q4385532
@@ Property / cites work: Q4385532 / rank @@
+Normal rank
@@ Property / cites work @@
+Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
+Normal rank
@@ Property / cites work @@
+Q3028369
@@ Property / cites work: Q3028369 / rank @@
+Normal rank
@@ Property / cites work @@
+Completion of a Set of Rules Modulo a Set of Equations
+Normal rank
@@ Property / cites work @@
+Automatic proofs by induction in theories without constructors
+Normal rank
@@ Property / cites work @@
+Q5581665
@@ Property / cites work: Q5581665 / rank @@
+Normal rank
@@ Property / cites work @@
+Schematization of infinite sets of rewrite rules generated by divergent completion processes
+Normal rank
@@ Property / cites work @@
+Proof by consistency
@@ Property / cites work: Proof by consistency / rank @@
+Normal rank
@@ Property / cites work @@
+Any ground associative-commutative theory has a finite canonical system
+Normal rank
@@ Property / cites work @@
+Complete Sets of Reductions for Some Equational Theories
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:5055774