Clones and maximal sets in set logic containing all Boolean functions
From MaRDI portal
This paper considers the logic of multivariable functions from the subsets of an \(r\)-element set into itself. A set of functions is called Boolean complete if with the help of Boolean operations it generates all functions. It is shown that there are \(2^r+w(r)-3\) maximal incomplete families and they are described (\(w(r)\) is the number of equivalence relations of an \(r\)-element set).
Recommendations
- scientific article; zbMATH DE number 3954876
- scientific article; zbMATH DE number 4070867
- Classification of the Maximal Clones of Two-Valued Logic
- Compositions and clones of Boolean functions
- On clones of operations over finite Boolean algebras
- scientific article; zbMATH DE number 3991417
- On the classes of Boolean functions generated by maximal partial ultraclones
- scientific article; zbMATH DE number 2209899
- Exclusive and essential sets of implicates of Boolean functions
- Partial clones containing all Boolean monotone self-dual partial functions
Cited in
(8)- On the classes of Boolean functions generated by maximal partial ultraclones
- Compositions and clones of Boolean functions
- scientific article; zbMATH DE number 1226440 (Why is no real title available?)
- scientific article; zbMATH DE number 1775482 (Why is no real title available?)
- Partial clones containing all Boolean monotone self-dual partial functions
- Classification of the Maximal Clones of Two-Valued Logic
- Boolean max-co-clones
- Relative completeness with respect to two unary functions
This page was built for publication: Clones and maximal sets in set logic containing all Boolean functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4382083)
