Due Thursday, February 22 at 1pm.
Due Thursday, February 22 at 1pm.
This entry was posted on Thursday, February 15th, 2007 at 4:28 pm and is filed under 117b: Computability theory. You can follow any responses to this entry through the RSS 2.0 feed. You can leave a response, or trackback from your own site.
For #3, < respects + probably should read
x < y -> x + z < y + z
instead. Just a minor detail.
(Edited)
A few more concerns:
1) x < y iff there is z such that x + z = y:
We are either defining leq or we want z neq 0. Of course we can define < this way, but it is just a bit more confusing. Judging from the statement 0 < 1 < x and also the definition of prime(x), however, I think we want < to signify strict inequality. But I could be wrong.
2) The hint tells us to show a model of PA. I think we want a model of PA-.
Hi, Jed.
Yes, you are right about #3, all the things you point out are typos. Thanks for spotting them, and sorry about that.
So, yes, “x less than y implies x+z less than y +z”,
“x less than y iff there is z *different from 0* such that x+z less than y+z”, and
in the hint, it should read PA- instead of PA.
*Sigh*
Just think of it as demonstrating the superiority of the blog format for classes ;). In a normal class, there’d have to be several emails back and forth before the professor notifies the students via the website that there is an error in the problem set, whereas here we get instant feedback.