ゲーデル数
Let "A" be a set of partial-recursive unary functions on the domain of natural numbers such that the set formula_1 is recursively enumerable, where formula_2 denotes the formula_3-th partial-recursive function in a Gödel numbering.