March 25
Ermek Nurkhaidarov,
Penn State Mont Alto
Automorphisms of countable short recursively saturated models of PA
In this talk we discuss automorphisms of countable short recursively saturated models of PA.
Kossak-Schmerl 95 shows that: if M is a countable, arithmetically saturated model of PA, then the automorphism group of M codes its standard system. We discuss how to prove a similar result for countable short arithmetically saturated models of PA.
This is joint work with Erez Shochat.