The pseudoidentity problem and reducibility for completely regular semigroups (Q2730741)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 1624937
Language Label Description Also known as
default for all languages
No label defined
    English
    The pseudoidentity problem and reducibility for completely regular semigroups
    scientific article; zbMATH DE number 1624937

      Statements

      The pseudoidentity problem and reducibility for completely regular semigroups (English)
      0 references
      0 references
      0 references
      19 December 2001
      0 references
      finite semigroups
      0 references
      pseudovarieties of semigroups
      0 references
      pseudoidentities
      0 references
      completely regular semigroups
      0 references
      implicit operations
      0 references
      Ash's inevitability theorem
      0 references
      hyperdecidability
      0 references
      For a pseudovariety \(\mathbf H\) of groups, let \(\overline{\mathbf H}\) be the pseudovariety consisting of all finite semigroups all of whose subgroups lie in \(\mathbf H\). The main result of the article (Theorem 4.1) gives necessary and sufficient conditions for a pseudidentity \(u=v\) to hold in \(\mathbf{CR}\cap\overline{\mathbf H}\) where \(\mathbf{CR}\) is the pseudovariety of all finite completely regular semigroups and \(\mathbf H\) is a given pseudovariety of groups. Let \(\kappa\) be the signature consisting of the usual semigroup multiplication and the standard unary implicit operation \(\omega\) (for any element \(x\) of a semigroup \(S\), \(x^\omega\) is the only idempotent power of \(x\)). The authors propose a strengthened version of Ash's inevitability theorem (\(\kappa\)-reducibility of the pseudovariety \(\mathbf G\) of all finite groups) as an open problem and show that if this stronger version holds then \(\mathbf{CR}\) is \(\kappa\)-reducible and, therefore, hyperdecidable (Theorem 6.4).
      0 references

      Identifiers