Unification in permutative equational theories is undecidable (Q1825190)

From MaRDI portal
Revision as of 11:11, 20 June 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Unification in permutative equational theories is undecidable
scientific article

    Statements

    Unification in permutative equational theories is undecidable (English)
    0 references
    1989
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    permutative equational theories
    0 references
    unifiability of terms
    0 references
    Turing machine
    0 references
    confluent term-rewriting system
    0 references