加载中…
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.

生成讲解博客的中文版本

生成AI智能校验的中文版本