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.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
