Small clones and the projection property
Maurice Pouzet, Ivo G.Rosenberg

TL;DR
This paper extends the classification of minimal clones from finite to infinite universes and multiclones, revealing structural properties and connections to Boolean groups.
Contribution
It generalizes the classification of minimal clones to infinite universes and multiclones, and links clone structures to Boolean groups.
Findings
Every non-trivial clone contains a small clone of one of five types.
If a clone contains all constant operations, then binary idempotent operations are projections.
Existence of non-projection idempotent operations relates to Boolean group structures.
Abstract
In 1986, the second author classified the minimal clones on a finite universe into five types. We extend this classification to infinite universes and to multiclones. We show that every non-trivial clone contains a "small" clone of one of the five types. From it we deduce, in part, an earlier result, namely that if is a clone on a universe with at least two elements, that contains all constant operations, then all binary idempotent operations are projections and some -ary idempotent operation is not a projection some if and only if there is a Boolean group on for which is the set of all operations of the form for and .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsComputability, Logic, AI Algorithms · Benford’s Law and Fraud Detection · Limits and Structures in Graph Theory
