A finitely axiomatizable undecidable equational theory with recursively solvable word problems (Q4955722)

From MaRDI portal
Revision as of 10:16, 30 July 2024 by Openalex240730090724 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 1449843
Language Label Description Also known as
English
A finitely axiomatizable undecidable equational theory with recursively solvable word problems
scientific article; zbMATH DE number 1449843

    Statements

    A finitely axiomatizable undecidable equational theory with recursively solvable word problems (English)
    0 references
    0 references
    22 May 2000
    0 references
    undecidable equational theory
    0 references
    recursively solvable word problems
    0 references
    many-sorted logics
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references