Termination proofs for term rewriting systems by lexicographic path orderings imply multiply recursive derivation lengths (Q673975)
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: Termination proofs for term rewriting systems by lexicographic path orderings imply multiply recursive derivation lengths |
scientific article; zbMATH DE number 985867
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Termination proofs for term rewriting systems by lexicographic path orderings imply multiply recursive derivation lengths |
scientific article; zbMATH DE number 985867 |
Statements
Termination proofs for term rewriting systems by lexicographic path orderings imply multiply recursive derivation lengths (English)
0 references
28 February 1997
0 references
term rewriting system
0 references
lexiographic path ordering
0 references
0 references
0.9077187776565552
0 references
0.906275749206543
0 references
0.8499231934547424
0 references
0.8400028347969055
0 references
