Equational classes of Boolean functions via the HSP theorem (Q1866850)

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.