The pseudoidentity problem and reducibility for completely regular semigroups

DOI10.1017/S000497270001950XzbMath0982.20042MaRDI QIDQ2730741

P. G. Trotter, Jorge Almeida

Publication date: 19 December 2001

Published in: Bulletin of the Australian Mathematical Society (Search for Journal in Brave)

zbMATH Keywords

completely regular semigroupsfinite semigroupsimplicit operationspseudovarieties of semigroupspseudoidentitieshyperdecidabilityAsh's inevitability theorem

Mathematics Subject Classification ID

Varieties and pseudovarieties of semigroups (20M07) Free semigroups, generators and relations, word problems (20M05) Regular semigroups (20M17)

Related Items (11)

Some reducibility properties for pseudovarieties of the form DRH ⋮ A NOTE ON PSEUDOVARIETIES OF COMPLETELY REGULAR SEMIGROUPS ⋮ Complete κ-reducibility of pseudovarieties of the form DRH ⋮ Towards a pseudoequational proof theory ⋮ TAMENESS OF JOINS INVOLVING THE PSEUDOVARIETY OF LOCAL SEMILATTICES ⋮ The word problem for \(\kappa \)-terms over the pseudovariety of local groups ⋮ Infinite-vertex free profinite semigroupoids and symbolic dynamics. ⋮ Representations of relatively free profinite semigroups, irreducibility, and order primitivity ⋮ Profinite topologies ⋮ CONJUGACY INVARIANTS OF SUBSHIFTS: AN APPROACH FROM PROFINITE SEMIGROUP THEORY ⋮ Tameness of pseudovariety joins involving R.

Cites Work

• Unnamed Item
• Unnamed Item
• Residual finiteness in completely regular semigroup varieties
• The Rhodes expansion and free objects in varieties of completely regular semigroups
• On the word problem for free completely regular semigroups
• Profinite categories and semidirect products
• On finitely based pseudovarieties of the forms \({\mathbf V}*{\mathbf D}\) and \({\mathbf V}*{\mathbf D}_n\)
• INEVITABLE GRAPHS: A PROOF OF THE TYPE II CONJECTURE AND SOME RELATED DECISION PROCEDURES
• On the Decidability of Iterated Semidirect Products with Applications to Complexity
• HYPERDECIDABLE PSEUDOVARIETIES AND THE CALCULATION OF SEMIDIRECT PRODUCTS
• UNDECIDABILITY, AUTOMATA, AND PSEUDOVARITIES OF FINITE SEMIGROUPS
• A SYNTACTICAL PROOF OF LOCALITY OF DA

This page was built for publication: The pseudoidentity problem and reducibility for completely regular semigroups