For each ternary propositional connective, we determine the minimum number of binary connectives needed to construct a logically equivalent formula. In order to reduce this problem to a computably feasible one, we prove a number of lemmas showing that every element of a large set of formulas is logically equivalent to a formula in a much smaller associated set
