Academia.eduAcademia.edu
paper cover icon
Maximal and minimal partial clones

Maximal and minimal partial clones

Journal of Automata, Languages and Combinatorics, 2001
Abstract
The following two problems are addressed in this paper. Let $k \geq 2$, $\k$ be a $k$-element set and $M$ be a family of maximal partial clones with trivial intersection over $k$. What is the smallest possible cardinality of $M$? Dually, if $F$ is a family of minimal partial clones whose join is the set of all partial functions on $k$, then what is the smallest possible cardinality of $F$? We show that the answer to these two problems is three.

Lucien Haddad hasn't uploaded this paper.

Let Lucien know you want this paper to be uploaded.

Ask for this paper to be uploaded.