 Then he assumes that this predicate is computable, and can hence be expressed in lambda calculus.Building on earlier work by Kleene and constructing a Gödel numbering for lambda expressions, he constructs a lambda expression "e" that closely follows the proof of Gödel's first incompleteness theorem.If "e" is applied to its own Gödel number, a contradiction results.