Reduce $\overline{K}$ to the set of natural numbers codifying programs such that the image of the function computed by the program has cardinal $2$ (roughly, the set of programs implementing functions whose image has exactly two elements) in order to prove that such set is not semi-decidable (not recursively enumerable).