Clones containing all almost unary functions
| dc.creator | Pinsker, Michael | |
| dc.date | 2004-01-10 | |
| dc.date.accessioned | 2026-07-07T05:04:28Z | |
| dc.date.available | 2026-07-07T05:04:28Z | |
| dc.description | Let X be an infinite set of regular cardinality. We determine all clones on X which contain all almost unary functions. It turns out that independently of the size of X, these clones form a countably infinite descending chain. Moreover, all such clones are finitely generated over the unary functions. In particular, we obtain an explicit description of the only maximal clone in this part of the clone lattice. This is especially interesting if X is countably infinite, in which case it is known that such a description cannot be obtained for the second maximal clone over the unary functions. | |
| dc.description | 20 pages | |
| dc.identifier | https://arxiv.org/abs/math/0401102 | |
| dc.identifier | http://arxiv.org/abs/math/0401102 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/69816 | |
| dc.subject | Rings and Algebras | |
| dc.subject | Logic | |
| dc.subject | 08A40; 08A05 | |
| dc.title | Clones containing all almost unary functions | |
| dc.type | text |