Clonoids of Boolean functions with essentially unary, linear, semilattice, or 0- or 1-separating source and target clones
arXiv:2412.01107 · doi:10.1142/S0218196725500419
Abstract
Extending Sparks's theorem, we determine the cardinality of the lattice of -clonoids of Boolean functions for certain pairs of clones of essentially unary, linear, or - or -separating functions or semilattice operations. When such a -clonoid lattice is uncountable, the proof is in most cases based on exhibiting a countably infinite family of functions with the property that distinct subsets thereof always generate distinct -clonoids. In the cases when the lattice is finite, we enumerate the corresponding -clonoids. We also provide a summary of the known results on cardinalities of -clonoid lattices of Boolean functions.
27 pages