The notion of completeness of a set of logical functions depends both on the way one is allowed to construct his network from the given set of logical primitives and on logical function the network is defined to realize. In this paper we refer three ways of these constructions and classify all Boolean functions into equivalence classes for each case, then we enumerate classes of bases under corresponding constructions.