Complexity of functions from some classes of three-valued logic

The problem of the complexity of realization of functions of the three-valued logic taking values from the set $\{0,1\}$ by formulas over incomplete generating systems is considered. Upper and lower asymptotic estimates for the corresponding Shannon functions are obtained.