Talk:Church's thesis (constructive mathematics)

To "formal statement"

Citation:

$(\forall x\exists y\;\phi (x,y))\to (\exists f\;\forall x\exists y,u\;\mathbf {T} (f,x,y,u)\wedge \phi (x,y))$

Where the variables range over the natural numbers, and $\phi$ is any predicate. This schema asserts that, if for every x there is a y satisfying some predicate, then there is in fact an f which is the Gödel number of a general recursive function which will, for every x, produce such a y satisfying that predicate. (T is some universal predicate which decodes the Gödel-numbering used.)

Not a word was written about what does the variable "u" mean. As a result, the whole statement is incomprehensible.

Eugepros (talk) 07:11, 3 August 2010 (UTC)