A complete proof of correctness of the Knuth-Bendix completion algorithm (Q1154801)

From MaRDI portal
Revision as of 02:43, 14 July 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
A complete proof of correctness of the Knuth-Bendix completion algorithm
scientific article

    Statements

    A complete proof of correctness of the Knuth-Bendix completion algorithm (English)
    0 references
    0 references
    1981
    0 references
    semidecision algorithm
    0 references
    validity problem in equational theories
    0 references
    decision procedure
    0 references
    term rewriting
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references