Termination proofs for term rewriting systems by lexicographic path orderings imply multiply recursive derivation lengths (Q673975)

From MaRDI portal
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
    0 references
    28 February 1997
    0 references
    0 references
    term rewriting system
    0 references
    lexiographic path ordering
    0 references
    0 references