 The result which is now most often referred to as Kleene’s Recursion Theorem can be used to unify a number of effective diagonal arguments similar to that underlying  Theorem 3.3  and has a wide range of applications both in computability theory and other areas of mathematical logic and computer  science.[22]  Although its statement is straightforward, both its significance and the following proof become clearer upon considering subsequent applications.