EQUATIONAL COMPLEXITY OF THE FINITE ALGEBRA MEMBERSHIP PROBLEM (Q3601326): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lyndon's groupoid is not inherently nonfinitely based / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of Some Problems Concerning Varieties and Quasi-Varieties of Algebras / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subdirect unions in universal algebra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonfinitely based pseudovarieties and inherently nonfinitely based varieties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finite bases for flat graph algebras / rank
 
Normal rank
Property / cites work
 
Property / cites work: On pseudovarieties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inherently nonfinitely based lattices / rank
 
Normal rank
Property / cites work
 
Property / cites work: A modular inherently nonfinitely based lattice / rank
 
Normal rank
Property / cites work
 
Property / cites work: INTERPRETING GRAPH COLORABILITY IN FINITE SEMIGROUPS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finite algebras of finite complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inherently Nonfinitely Based Solvable Algebras / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4445976 / rank
 
Normal rank
Property / cites work
 
Property / cites work: THE MEMBERSHIP PROBLEM IN FINITE FLAT HYPERGRAPH ALGEBRAS / rank
 
Normal rank
Property / cites work
 
Property / cites work: THE RESIDUAL BOUNDS OF FINITE ALGEBRAS / rank
 
Normal rank
Property / cites work
 
Property / cites work: THE RESIDUAL BOUND OF A FINITE ALGEBRA IS NOT COMPUTABLE / rank
 
Normal rank
Property / cites work
 
Property / cites work: TARSKI’S FINITE BASIS PROBLEM IS UNDECIDABLE / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Birkhoff theorem for finite algebras / rank
 
Normal rank
Property / cites work
 
Property / cites work: COMPUTATIONAL COMPLEXITY OF THE FINITE ALGEBRA MEMBERSHIP PROBLEM FOR VARIETIES / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tarski’s finite basis problem via 𝐀(𝒯) / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 02:02, 29 June 2024

scientific article
Language Label Description Also known as
English
EQUATIONAL COMPLEXITY OF THE FINITE ALGEBRA MEMBERSHIP PROBLEM
scientific article

    Statements

    EQUATIONAL COMPLEXITY OF THE FINITE ALGEBRA MEMBERSHIP PROBLEM (English)
    0 references
    0 references
    0 references
    0 references
    10 February 2009
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    equational complexity
    0 references
    variety of algebras
    0 references
    inherently nonfinitely based
    0 references
    shift automorphism method
    0 references
    graph algebra
    0 references
    automatic algebra
    0 references
    membership problem of a variety
    0 references