Termination proofs for term rewriting systems by lexicographic path orderings imply multiply recursive derivation lengths (Q673975): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0304-3975(94)00135-6 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2049865932 / rank | |||
Normal rank | |||
Revision as of 18:52, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Termination proofs for term rewriting systems by lexicographic path orderings imply multiply recursive derivation lengths |
scientific article |
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
