We estimate the realization complexity of functions from P_3,2 - the set of all 3-valued logic functions, taking values 0 or 1, - by formulas. For any finitely-generated maximal (among all closed sets with the same projection) closed set of functions from P_3,2 and for some finite generating system the upper and lower bounds for corresponding Shannon functions are derived. For any but maximal finitely-generated closed set of functions from P_3,2 whose projection is the set of all linear Boolean functions, and for some finite generating system we provide the exact values of corresponding Shannon functions. Also, for some countable set B of closed sets of Boolean functions, for any closed set F of functions from P_3,2 such that pr F=B, and for any finite system that generates F, we prove that the corresponding Shannon depth function has linear order of growth.

Many-Valued Logic Functions, Formulas, Complexity

Mathematical problems and theory of numerical methods