Polynomial Time Uniform Word Problems (Q4835521)

From MaRDI portal
Revision as of 15:15, 30 December 2024 by Import241228121245 (talk | contribs) (Normalize DOI.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)





scientific article; zbMATH DE number 761101
Language Label Description Also known as
English
Polynomial Time Uniform Word Problems
scientific article; zbMATH DE number 761101

    Statements

    Polynomial Time Uniform Word Problems (English)
    0 references
    6 June 1995
    0 references
    universal theory of lattices
    0 references
    polynomial time decidability
    0 references
    finite axiomatizability
    0 references
    uniform word problem
    0 references
    quasivariety
    0 references
    universal Horn class
    0 references
    universal closure
    0 references
    weak embedding closure
    0 references
    0 references

    Identifiers

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