Roman Kossak : Classification problems in Models of PA.

Posted by , part of the Logic Seminar.

At

Jan. 19, 2010, 2:30 p.m.

In

SEO 612

Abstract

I will briefly review the basics of Borel reducibility theory and I will discuss its applications to model theory of Peano Arithmetic. I will focus on the isomorphism problem for finitely generated models and on the conjugacy problem for various expansions of countable recursively saturated models. It is joint work with Samuel Coskey.

seminar begins with tea.