Abstract
We investigate representations of Boolean functions by formulas. In terms of the residual functions, we describe Boolean functions realised by repetition-free formulas in pre-elementary bases {∨, ·, –, 0, 1, x1(x2 ∨ . . . ∨ xn) ∨ x2 · . . . · xn} where n ≥ 4.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have