The maximal clones on countable sets that include all permutations. (Q1771946)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The maximal clones on countable sets that include all permutations. |
scientific article; zbMATH DE number 2158806
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The maximal clones on countable sets that include all permutations. |
scientific article; zbMATH DE number 2158806 |
Statements
The maximal clones on countable sets that include all permutations. (English)
0 references
19 April 2005
0 references
It was recently shown by M.\ Goldstern and S.\ Shelah that the lattice of clones on an infinite (countable) set \(X\) is not dually atomic. The author classifies those maximal clones on \(X\) that contain all permutations. By G.\ P.\ Gavrilov, two of them include all unary functions. The others are represented in the form \(\text{Pol}(M)\) for countably unary monoids \(M\) of unary functions. The paper contains an explicit description of these monoids.
0 references
maximal clone
0 references
monoid of unary functions
0 references
precomplete clone
0 references