Clones and maximal sets in set logic containing all Boolean functions (Q4382083)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1134609
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Clones and maximal sets in set logic containing all Boolean functions |
scientific article; zbMATH DE number 1134609 |
Statements
26 March 1998
0 references
many valued logic
0 references
complete sets
0 references
0.87097704
0 references
0.86835426
0 references
0.8654426
0 references
0.8645195
0 references
0.8554046
0 references
Clones and maximal sets in set logic containing all Boolean functions (English)
0 references
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).
0 references