Hello,

Consider some logical statement (I am talking about natural numbers all the way). P(x, y, z) is a computable statement:

For all x: There exists an y: For all z: P(x,y,z) is true.

I suppose this would have a Kleene level of 3.

Now, you could not consider *all* x, y and z, but only the values from zero to below a+q, a+v and a+w:

For all x < a + q: There exists an y < a + v: For all z < a + w: P(x, y, z) is true.

Clearly, you could program a Turing machine to check whether this is true.

Now: Is the statement "No matter how big you make a, you can always find (q, v, w) (natural numbers) were said Turing machine will output 'True'" equivalent to the first statement?

Consider it were. Because you can construct functions that map one integer to n integers, you could represent the tuple (q, v, w) as one natural number (call it p), and the Turing machine calculates the (q, v, w) out of this natural number (we call this Turing TM_P). Then you could rephrase the question:

For all a: There exists a p: TM_P(a, p) will output true.

Now, that would clearly imply a collapse of the Arithmetical hierarchy, as you only need some number of levels to make statements about Turing machines (I don't know the details here) and then two additional levels to make the "For all a, there exists a p" claim.

Where does this reasoning fail? And does it fail, after all? If no: What did I do wrong that I did not read about it?