Stability of Boolean function classes with respect to clones of linear functions
From MaRDI portal
Abstract: We consider classes of Boolean functions stable under compositions both from the right and from the left with clones. Motivated by the question how many properties of Boolean functions can be defined by means of linear equations, we focus on stability under compositions with the clone of linear idempotent functions. It follows from a result by Sparks that there are countably many such linearly definable classes of Boolean functions. In this paper, we refine this result by completely describing these classes. This work is tightly related with the theory of function minors, stable classes, clonoids, and hereditary classes, topics that have been widely investigated in recent years by several authors including Maurice Pouzet and his coauthors.
Cited in
(5)- Clonoids between modules
- Clonoids of Boolean functions with a linear source clone and a semilattice or 0- or 1-separating target clone
- Clonoids of Boolean functions with a monotone or discriminator source clone
- Clonoids of Boolean functions with essentially unary, linear, semilattice, or 0- or 1-separating source and target clones
- Near-unanimity-closed minions of Boolean functions
This page was built for publication: Stability of Boolean function classes with respect to clones of linear functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6358453)
