- C contains all the projections πkn: An → A, defined by πkn(x1, …,xn) = xk,
- C is closed under (finitary multiple) composition (or "superposition"): if f, g1, …, gm are members of C such that if f is m-ary, and gj is n-ary for every j, then the n-ary operation h(x1, …,xn) := f(g1(x1, …,xn), …, gm(x1, …,xn)) is in C.
The question whether clones should contain nullary operations or not is not treated uniformly in the literature. The classical approach as evidenced by the standard monographs on clone theory considers clones only containing at least unary operations. However, with only minor modifications (related to the empty invariant relation) most of the usual theory can be lifted to clones allowing nullary operations:4-5. The more general concept includes all clones without nullary operations as subclones of the clone of all at least unary operations:5 and is in accordance with the custom to allow nullary terms and nullary term operations in universal algebra. Typically, publications studying clones as abstract clones, e.g. in the category theoretic setting of Lawvere's algebraic theories, will include nullary operations.
Given an algebra in a signature σ, the set of operations on its carrier definable by a σ-term (the term functions) is a clone. Conversely, every clone can be realized as the clone of term functions in a suitable algebra by simply taking the clone itself as source for the signature σ so that the algebra has the whole clone as its fundamental operations.
If A and B are algebras with the same carrier such that every basic function of A is a term function in B and vice versa, then A and B have the same clone. For this reason, modern universal algebra often treats clones as a representation of algebras which abstracts from their signature.
There is only one clone on the one-element set (there are two if nullary operations are considered). The lattice of clones on a two-element set is countable, and has been completely described by Emil Post (see Post's lattice, which traditionally does not show clones with nullary operations). Clones on larger sets do not admit a simple classification; there are continuum clones on a finite set of size at least three, and 22κ clones on an infinite set of cardinality κ.
- a set Cn for each natural number n,
- elements πk,n in Cn for all k ≤ n, and
- a family of functions ∗:Cm × (Cn)m → Cn for all m and n
- c * (π1,n,...,πn,n) = c
- πk,m * (c1,...,cm) = ck
- c * (d1 * (e1, ..., en), ..., dm * (e1, ..., en)) = (c * (d1,..., dm)) * (e1,...,en).
Any concrete clone determines an abstract clone in the obvious manner.
Any algebraic theory determines an abstract clone where Cn is the set of terms in n variables, πk,n are variables, and ∗ is substitution. Two theories determine isomorphic clones if and only if the corresponding categories of algebras are isomorphic. Conversely every abstract clone determines an algebraic theory with an n-ary operation for each element of Cn. This gives a bijective correspondence between abstract clones and algebraic theories.
Every abstract clone C induces a Lawvere theory in which the morphisms m → n are elements of (Cm)n. This induces a bijective correspondence between Lawvere theories and abstract clones.
- Denecke, Klaus (2003). "Menger algebras and clones of terms". East–West Journal of Mathematics. 5 (2): 179. ISSN 1513-489X.
- Pöschel, Reinhard; Kalužnin, Lev A. (1979). Funktionen- und Relationenalgebren. Ein Kapitel der diskreten Mathematik. Mathematische Monographien (in German). 15. Berlin: VEB Deutscher Verlag der Wissenschaften.
- Szendrei, Ágnes (1986). Clones in Universal Algebra. Séminaire de Mathématiques Supérieures. 99. Montréal, QC: Presses de l'Université de Montréal. ISBN 2-7606-0770-4.
- Lau, Dietlinde (2006). Function Algebras on Finite Sets. A basic course on many-valued logic and clone theory. Springer Monographs in Mathematics. Berlin: Springer. doi:10.1007/3-540-36023-9. ISBN 978-3-540-36022-3.
- Behrisch, Mike (2014). Power, John; Wingfield, Cai, eds. "Clones with Nullary Operations" (pdf). Electronic Notes in Theoretical Computer Science. Amsterdam: Elsevier Sci. B. V. 303: 3–35. doi:10.1016/j.entcs.2014.02.002. ISSN 1571-0661.
- McKenzie, Ralph N.; McNulty, George F.; Taylor, Walter F. (1987). Algebras, Lattices, Varieties. I. Monterey, CA: Wadsworth & Brooks/Cole Advanced Books & Software. p. 143. ISBN 0-534-07651-3.
- Trnková, Vera; Sichler, Jiří (2009). "All clones are centralizer clones". Algebra Universalis. 61 (1). doi:10.1007/s00012-009-0004-4. ISSN 0002-5240.
- Trnková, Vera; Sichler, Jiří (2008). "On clones determined by their initial segments". Cahiers de Topologie et Géométrie Différentielle Catégoriques. 49 (3). ISSN 1245-530X.
- Cohn, Paul Moritz (1981). Universal Algebra. Mathematics and its Applications. 6 (2nd ed.). Dordrecht-Boston, Mass.: D. Reidel Publishing Co. p. 127. ISBN 90-277-1254-9.
- McKenzie, Ralph N.; McNulty, George F.; Taylor, Walter F. (1987). Algebras, Lattices, Varieties. I. Monterey, CA: Wadsworth & Brooks/Cole Advanced Books & Software. ISBN 0-534-07651-3.
- Lawvere, F. William (1963). Functorial semantics of algebraic theories (PhD). Columbia University. Available online at Reprints in Theory and Applications of Categories