Inductive proofs by specification transformations (Q5055713): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/3-540-51081-8_101
+Normal rank
@@ Property / OpenAlex ID @@
+W1601086057
@@ Property / OpenAlex ID: W1601086057 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3490949
@@ Property / cites work: Q3490949 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3725540
@@ Property / cites work: Q3725540 / rank @@
+Normal rank
@@ Property / cites work @@
+Reductions in tree replacement systems
@@ Property / cites work: Reductions in tree replacement systems / rank @@
+Normal rank
@@ Property / cites work @@
+Q3880309
@@ Property / cites work: Q3880309 / rank @@
+Normal rank
@@ Property / cites work @@
+Proofs by induction in equational theories with constructors
+Normal rank
@@ Property / cites work @@
+Automatic proofs by induction in theories without constructors
+Normal rank
@@ Property / cites work @@
+Q3795207
@@ Property / cites work: Q3795207 / rank @@
+Normal rank
@@ Property / cites work @@
+Proof by consistency
@@ Property / cites work: Proof by consistency / rank @@
+Normal rank
@@ Property / cites work @@
+On sufficient-completeness and related properties of term rewriting systems
+Normal rank
@@ Property / cites work @@
+Q3783519
@@ Property / cites work: Q3783519 / rank @@
+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 @@
+On the correspondence between two classes of reduction systems
+Normal rank