Clonoids of Boolean functions with a linear source clone and a semilattice or 0- or 1-separating target clone
arXiv:2504.04481 · doi:10.1007/s00012-026-00926-x
Abstract
Extending Sparks's theorem, we determine the cardinality of the lattice of -clonoids of Boolean functions for certain pairs of clones of Boolean functions. Namely, when is a subclone (a proper subclone, resp.) of the clone of all linear (affine) functions and is a subclone of the clone generated by a semilattice operation and constants (a subclone of the clone of all - or -separating functions, resp.), then the lattice of -clonoids is uncountable. Combining this fact with several earlier results, we obtain a complete classification of the cardinalities of the lattices of -clonoids for all pairs of clones on .
19 pages, a few typos fixed, abstract rewritten. arXiv admin note: text overlap with arXiv:2412.01107
References in corpus (5)
- Algebraic approach to promise constraint satisfaction
- Stability of Boolean function classes with respect to clones of linear functions
- Near-unanimity-closed minions of Boolean functions
- Clonoids of Boolean functions with essentially unary, linear, semilattice, or 0- or 1-separating source and target clones
- Clonoids of Boolean functions with a monotone or discriminator source clone