eCite Digital Repository
The pseudoidentity problem and reducibility for completely regular semigroups
Citation
Almeida, J and Trotter, PG, The pseudoidentity problem and reducibility for completely regular semigroups, Bulletin of the Australian Mathematical Society, 63, (3) pp. 407-433. ISSN 0004-9727 (2001) [Refereed Article]
DOI: doi:10.1017/S000497270001950X
Abstract
Necessary and sufficient conditions for equality over the pseudovariety CR of all finite completely regular semigroups are obtained. They are inspired by the solution of the word problem for free completely regular semigroups and clarify the role played by groups in the structure of such semigroups. A strengthened version of Ash's inevitability theorem (κ-reducibility of the pseudovariety G of all finite groups) is proposed as an open problem and it is shown that, if this stronger version holds, then CR is also κ-reducible and, therefore, hyperdecidable. © Clearance Centre, Inc.
Item Details
Item Type: | Refereed Article |
---|---|
Research Division: | Mathematical Sciences |
Research Group: | Pure mathematics |
Research Field: | Group theory and generalisations |
Objective Division: | Expanding Knowledge |
Objective Group: | Expanding knowledge |
Objective Field: | Expanding knowledge in the mathematical sciences |
UTAS Author: | Almeida, J (Professor Jane Almeida) |
UTAS Author: | Trotter, PG (Dr Peter Trotter) |
ID Code: | 21221 |
Year Published: | 2001 |
Web of Science® Times Cited: | 13 |
Deposited By: | Mathematics |
Deposited On: | 2001-08-01 |
Last Modified: | 2002-05-09 |
Downloads: | 0 |
Repository Staff Only: item control page