In this paper we show how nonrecursive combinatorial functions can be used to obtain another proof of the compactness Theorem 3.1 of . Our method is closely related to the argument used to show that a countable ultraproduct is ℵ1-saturated. What we do is to diagonalize in the most obvious way. The main difficulty with this approach is that the resulting diagonal function need not be recursive. Just to give an idea of how bad nonrecursive combinatorial functions are, we mention that by using frames (cf. ) they do not extend to Λ, and that by using normal combinatorial operators (cf. ) they do extend to Λ, map Λ into Λ, but in general, composition of such functions does not commute with their extension. We take care of this problem by constructing a large class of isols with respect to which the diagonal function is well behaved. The advantage of our method is that it provides the investigator with a natural and intuitive way of constructing counterexamples in his own research area.