Equational classes of Boolean functions via the HSP theorem
From MaRDI portal
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.
Recommendations
Cited in
(9)- Trading properties and Alexandrov kernels for Boolean functions
- Definability of Boolean function classes by linear equations over \(\mathbf{GF}(2)\)
- Post classes characterized by functional terms
- Equational characterizations of Boolean function classes
- Equivalent transformations of formulas in \(P_2\).
- scientific article; zbMATH DE number 5370539 (Why is no real title available?)
- On solutions to systems of functional equations of multiple-valued logic
- Solutions to the systems of functional equations of multivalued logic
- On complexity of problem of satisfiability for systems of countable-valued functional equations
This page was built for publication: Equational classes of Boolean functions via the HSP theorem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1866850)
