Re: Is FLT in the language of PA?
- From: "george" <greeneg@xxxxxxxxxx>
- Date: 23 Dec 2006 08:47:28 -0800
Daryl McCullough wrote:
Ay, Ex < y*y Phi(x,y)
where Phi(x,y) is of the form t(x,y) = s(x,y)
where t and s are terms involving 0, plus, times, successor
and the variables x and y.
How do you go about eliminating the inner quantifier?
Well, you are mixing methods (or fruits, as in apples & oranges) here.
The whole point was that we were in a context with
ONLY bounded quantifiers. In the context of this discussion,
you DON'T GET to say AyEx<y[foo(x,y)]. You must say instead
Ay<zEx<y[foo(x,y)].
So could you please now make a good faith effort
to figure this out for yourself instead of attacking my
expository skills by claiming that you can't figure it
out because I haven't explained it well enough yet?
.
- References:
- Re: Is FLT in the language of PA?
- From: george
- Re: Is FLT in the language of PA?
- From: Daryl McCullough
- Re: Is FLT in the language of PA?
- Prev by Date: Re: How long are the arms of Formalisms?
- Next by Date: Re: Is FLT in the language of PA?
- Previous by thread: Re: Is FLT in the language of PA?
- Next by thread: Re: Is FLT in the language of PA?
- Index(es):
Relevant Pages
|