Equational classes of Boolean functions via the HSP theorem (Q1866850)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Equational classes of Boolean functions via the HSP theorem |
scientific article; zbMATH DE number 1899970
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Equational classes of Boolean functions via the HSP theorem |
scientific article; zbMATH DE number 1899970 |
Statements
Equational classes of Boolean functions via the HSP theorem (English)
0 references
23 April 2003
0 references
The main result of the paper is: Theorem 4.3. Let \(\mathcal C\) be a class of Boolean functions. The following are equivalent: {(i)} \(\mathcal C\) is characterized by a set of equational sentences; {(ii)} \(\mathcal C\) is closed under cylindrification, diagonalization and permutation of variables. The proof is not constructive and the theorem can be reformulated (as theorem 11.1 in the paper) in a variant connected with the HSP theorem.
0 references
Boolean functions
0 references
permutation of variables
0 references
cylindrification
0 references
diagonalization
0 references
