## transfinite recursion

Prove a more general Transfinite Recursion Theorem (Double Recursion Theorem): Let G be an operation in two variables. Then there is an operation F such that F(beta,alpha) = G(F restricted on (beta x alpha)) for all ordinals beta and alpha. I've got a hint that computation are functions on (beta + 1) x (alpha + 1)

Any ideas?