Abstract
In this paper we address the question “How many properties of Boolean functions can be defined by means of linear equations?” 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 and stable classes, a topic that has been widely investigated in recent years by several authors including Maurice Pouzet.
Original language | British English |
---|---|
Pages (from-to) | 21-28 |
Number of pages | 8 |
Journal | CEUR Workshop Proceedings |
Volume | 2925 |
State | Published - 2020 |
Event | 1st International Conference "Algebras, Graphs and Ordered Sets", ALGOS 2020 - Virtual, Online Duration: 26 Aug 2020 → 28 Aug 2020 |
Keywords
- Boolean function
- Clone
- Clonoid
- Functional equation
- Linear definability