Clonoids of Boolean functions with essentially unary, linear, semilattice, or 0- or 1-separating source and target clones.

Saved in:
Bibliographic Details
Title: Clonoids of Boolean functions with essentially unary, linear, semilattice, or 0- or 1-separating source and target clones.
Authors: Lehtonen, Erkko1 (AUTHOR) erkko.lehtonen@ku.ac.ae
Source: International Journal of Algebra & Computation. Feb2026, Vol. 36 Issue 1, p17-50. 34p.
Subjects: Boolean functions, Lattice theory, Linear operators, Cardinal numbers, Semilattices, Mathematical functions
Abstract: Extending Sparks's theorem, we determine the cardinality of the lattice of (C 1 , C 2) -clonoids of Boolean functions for certain pairs (C 1 , C 2) of clones of essentially unary, linear, or 0 - or 1 -separating functions or semilattice operations. When such a (C 1 , C 2) -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 (C 1 , C 2) -clonoids. In the cases when the lattice is finite, we enumerate the corresponding (C 1 , C 2) -clonoids. We also provide a summary of the cardinalities of (C 1 , C 2) -clonoid lattices of Boolean functions. [ABSTRACT FROM AUTHOR]
Copyright of International Journal of Algebra & Computation is the property of World Scientific Publishing Company and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Database: Engineering Source
Description
Abstract:Extending Sparks's theorem, we determine the cardinality of the lattice of (C 1 , C 2) -clonoids of Boolean functions for certain pairs (C 1 , C 2) of clones of essentially unary, linear, or 0 - or 1 -separating functions or semilattice operations. When such a (C 1 , C 2) -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 (C 1 , C 2) -clonoids. In the cases when the lattice is finite, we enumerate the corresponding (C 1 , C 2) -clonoids. We also provide a summary of the cardinalities of (C 1 , C 2) -clonoid lattices of Boolean functions. [ABSTRACT FROM AUTHOR]
ISSN:02181967
DOI:10.1142/S0218196725500419