Automorphism Groups of Countable, Recursively Saturated Models of Peano Arithmetic

CUNY Logic WorkshopFriday, October 25, 20132:00 pmGC 6417

Jim Schmerl

Automorphism Groups of Countable, Recursively Saturated Models of Peano Arithmetic

University of Connecticut

It is still unknown whether there are nonisomorphic countable recursively saturated models M and N whose automorphism groups Aut(M) and Aut(N) are isomorphic. I will discuss what has happened over the last 20 years towards showing that such models do not exist, including some very recent results.

Posted by on October 15th, 2013