Binary logic bases
Digital devices synthesized with the use of different binary logic bases could have different complexity depending on the component base technology. The Post-Yablonsky theorem deﬁ nes which elementary boolean functions form basis. But there is a task to determine the common number of not redundant bases, i. e. bases which lose their functionally completeness if any function was removed. This problem is interesting not from mathematical point of view only, but from the side of developer too - he could choose the most acceptable way of implementation. The task of enumeration of all not redundant bases of classical binary logic is considered. Authors adduce formulas of correspondence between primary basis {AND; OR; NOT} and functions of stated bases. Also authors adduce an example of implementation of not redundant bases for logical circuit design.