MW: Time to finish off Enayat’s Theorem 7:
Theorem 7: Every countable recursively saturated model N of PA+ΦT is a T-standard model of PA.
MW: Time to finish off Enayat’s Theorem 7:
Theorem 7: Every countable recursively saturated model N of PA+ΦT is a T-standard model of PA.
Filed under Conversations, Peano Arithmetic
MW: We’re still going through Enayat’s proof of his Theorem 7:
Theorem 7: Every countable recursively saturated model N of PA+ΦT is a T-standard model of PA.
Filed under Conversations, Peano Arithmetic
MW: I ended the last post with a puzzle. Here it is again, in more detail.
Filed under Conversations, Peano Arithmetic
MW: Enayat’s second major result is:
Theorem 7: Every countable recursively saturated model of PA+ΦT is a T-standard model of PA.
Filed under Conversations, Peano Arithmetic
Everyone has their pet peeves, and peeves about language abound. My pet peeve is with people who object that “very unique” is illogical. For example, this pithy statement:
Uniqueness is a binary condition. Something is unique or it is not. There are no degrees of uniqueness. Something cannot be partly unique, mostly unique, very unique, etc.
Prev Next
Another post from the History Book Club, this time based on three books:
Filed under Astronomy, History Book Club
MW: Continuing the recap… Continue reading
Filed under Peano Arithmetic
MW: It’s been ages since John Baez and I discussed Enayat’s paper—not since October 2020! John has since moved on to fresh woods and pastures new. I’ve been reading novels. But I feel I owe it to our millions of readers to finish the tale, so here goes.
Filed under Peano Arithmetic

National Palace Museum, Taipei, Taiwan
Another post from the History Book Club.
Filed under History Book Club