On composition-closed classes of Boolean functions
From MaRDI portal
Publication:4583707
Abstract: We determine all composition-closed equational classes of Boolean functions. These classes provide a natural generalization of clones and iterative algebras: they are closed under composition, permutation and identification (diagonalization) of variables and under introduction of inessential variables (cylindrification), but they do not necessarily contain projections. Thus the lattice formed by these classes is an extension of the Post lattice. The cardinality of this lattice is continuum, yet it is possible to describe its structure to some extent.
Recommendations
Cited in
(21)- scientific article; zbMATH DE number 736301 (Why is no real title available?)
- scientific article; zbMATH DE number 4110759 (Why is no real title available?)
- Algebraic and topological closure conditions for classes of pseudo-Boolean functions
- On the lattice of equational classes of Boolean functions and its closed intervals
- Composition of Post classes and normal forms of Boolean functions
- Equationally closed classes of partial Boolean functions
- Composition of Boolean functions: an application to the secondary constructions of bent functions
- On inherited properties of restricted Boolean functions
- On the classes of Boolean functions generated by maximal partial ultraclones
- Equational characterizations of Boolean function classes
- New iterative chain classes of pseudo-Boolean functions
- On the shape of solution sets of systems of (functional) equations
- Equational classes of Boolean functions via the HSP theorem
- On bases of all closed classes of Boolean vector functions
- Post classes characterized by functional terms
- Closed classes of Boolean functions. 2nd ed.
- Sequential discreteness and clopen-I-Boolean classes
- On bases of closed classes of Boolean vector functions
- scientific article; zbMATH DE number 1544631 (Why is no real title available?)
- scientific article; zbMATH DE number 6973795 (Why is no real title available?)
- Strong closure operators on the set of partial Boolean functions
This page was built for publication: On composition-closed classes of Boolean functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4583707)