Abstract
Extending Sparks’s theorem, we determine the cardinality of the lattice of (C1,C2)-clonoids of Boolean functions for certain pairs (C1,C2) of clones of essentially unary, linear, or 0- or 1-separating functions or semilattice operations. When such a (C1,C2)-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 (C1,C2)-clonoids. In the cases when the lattice is finite, we enumerate the corresponding (C1,C2)-clonoids. We also provide a summary of the cardinalities of (C1,C2)-clonoid lattices of Boolean functions.
| Original language | British English |
|---|---|
| Pages (from-to) | 17-50 |
| Number of pages | 34 |
| Journal | International Journal of Algebra and Computation |
| Volume | 36 |
| Issue number | 1 |
| DOIs | |
| State | Published - 1 Feb 2026 |
Keywords
- Boolean function
- clone
- Clonoid
- minion
Fingerprint
Dive into the research topics of 'Clonoids of Boolean functions with essentially unary, linear, semilattice, or 0- or 1-separating source and target clones'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver