A minimal nonfinitely based semigroup whose variety is polynomially recognizable.

DOI10.1007/s10958-011-0512-6zbMath1290.20047arXiv1008.2425OpenAlexW3100329821MaRDI QIDQ2248321

S. I. Kublanovsky, S. V. Goldberg, Mikhail V. Volkov

Publication date: 26 June 2014

Published in: Journal of Mathematical Sciences (New York) (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1008.2425

zbMATH Keywords

bases of identitiesmembership problemvarieties of semigroupsnonfinitely based semigroups

Mathematics Subject Classification ID

Lattices of varieties (08B15) Varieties and pseudovarieties of semigroups (20M07) Free semigroups, generators and relations, word problems (20M05)

Related Items

Minimal non-finitely based semigroups.

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The finite basis property for varieties of semigroups
• The finite basis question for semigroups of order less than six
• On cross semigroup varieties and related questions
• Completely O-simple semigroups and their associated graphs and groups
• Identities of a five-element \(0\)-simple semigroup
• Algorithmic problems for finite groups and finite \(0\)-simple semigroups
• Identity bases for some non-exact varieties.
• The pseudovariety generated by completely \(0\)-simple semigroups
• Bases for equational theories of semi-groups
• Identical relations in finite groups
• Complexity issues of checking identities in finite monoids
• LIMIT VARIETIES GENERATED BY COMPLETELY 0-SIMPLE SEMIGROUPS
• COMPUTATIONAL COMPLEXITY OF THE FINITE ALGEBRA MEMBERSHIP PROBLEM FOR VARIETIES
• An example of a finite semigroup without an irreducible basis of identities in the class of completelyo-simple semigroups
• COMPUTATIONALLY AND ALGEBRAICALLY COMPLEX FINITE ALGEBRA MEMBERSHIP PROBLEMS
• A 2EXPTIME Complete Varietal Membership Problem
• Matrix rank 1 semigroup identities
• ON A BASIS OF THE PRODUCT OF VARIETIES OF GROUPS
• Complexity of Some Problems Concerning Varieties and Quasi-Varieties of Algebras
• ALGORITHMIC PROBLEMS IN VARIETIES
• THE PERKINS SEMIGROUP HAS CO-NP-COMPLETE TERM-EQUIVALENCE PROBLEM
• INTERPRETING GRAPH COLORABILITY IN FINITE SEMIGROUPS
• On Comparison of Finite Algebras