The complexity of the realization of symmetrical functions by formulae

It is proved that every symmetric function in $k$-valued logic of $n$ arguments can be realized by a formula in any basis, the complexity of the formula not exceeding $n^C$, where $C$ is a constant depending on the basis. It is shown that in the case $k=2$, $C\leqslant 4,93$ for all bases.