On composition-closed classes of Boolean functions
From MaRDI portal
Publication:4583707
zbMATH Open1393.06016arXiv1102.4355MaRDI QIDQ4583707FDOQ4583707
Authors: Tamás Waldhauser 
Publication date: 3 September 2018
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.
Full work available at URL: https://arxiv.org/abs/1102.4355
Recommendations
Boolean functioncloneiterative algebraequational classfunction class compositionrelational constraintPost latticePost class
Boolean functions (06E30) Operations and polynomials in algebraic structures, primal algebras (08A40) Post algebras (lattice-theoretic aspects) (06D25)
Cited In (21)
- Title not available (Why is that?)
- On the lattice of equational classes of Boolean functions and its closed intervals
- Algebraic and topological closure conditions for classes of pseudo-Boolean functions
- 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
- On bases of all closed classes of Boolean vector functions
- Equational classes of Boolean functions via the HSP theorem
- Post classes characterized by functional terms
- Closed classes of Boolean functions. 2nd ed.
- Sequential discreteness and clopen-I-Boolean classes
- Title not available (Why is that?)
- Title not available (Why is that?)
- On bases of closed classes of Boolean vector functions
- Strong closure operators on the set of partial Boolean functions
- Title not available (Why is that?)
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)
