On an infinite sequence of improving Boolean bases

Abstract We consider complexity of formulas for Boolean functions in finite complete bases. It is shown that, as regards complexity, the basis of all (k+1)-ary functions is essentially better than the basis of all k-ary functions for all k⩾2.