How to prove equivalence of term rewriting systems without induction (Q1183582)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: How to prove equivalence of term rewriting systems without induction |
scientific article; zbMATH DE number 33400
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | How to prove equivalence of term rewriting systems without induction |
scientific article; zbMATH DE number 33400 |
Statements
How to prove equivalence of term rewriting systems without induction (English)
0 references
28 June 1992
0 references
equivalence of term rewriting systems
0 references
Church-Rosser property
0 references
reachability
0 references
inductionless induction
0 references
