Tuesday, February 14 from 3 to 4pm

*Room*: MB 124

*Speaker*: Sam Dworetzky (BSU)

*Title*: The classification problem for models of Peano Arithmetic

*Abstract*: It is well known that the countable models of Peano Arithmetic (PA) are complicated to classify. In this talk we will make this precise using the language of Borel complexity theory. We will use a construction of Gaifman to show there is a Borel reduction from the isomorphism relation on linear orders to the isomorphism relation on models of PA.