function class composition; clones; Boolean functions; Post Classes; class factorization; normal forms; DNF; CNF; Zhegalkin polynomial; applications of universal algebra in computer science
Abstract :
[en] We present some compositions of clones of Boolean functions that imply factorizations of ?, the clone of all Boolean functions, into minimal clones. These can be interpreted as representation theorems, providing representations of Boolean functions analogous to the disjunctive normal form, the conjunctive normal form, and the Zhegalkin polynomial representations.
