Abstract
The paper considers the problem of expressibility of total Boolean functions by superpositions over a system of partial Boolean functions. The problem is solved in terms of precomplete Boolean classes, i.e., extensions of Post classes in the algebra of partial Boolean functions.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
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
