AMS special session on model theory and its applications, Wesleyan, October 2008 (Wesleyan slides)
Abstract: Often a “classification problem” can be regarded as an equivalence relation on a standard Borel space (i.e., a Polish space equipped just with its σ-algebra of Borel sets). For instance, the classification problem for countable linear orders (on $\omega$) corresponds to the isomorphism equivalence relation on a suitable subspace of $\mathcal P(\omega\times\omega)$. This allows for an analysis of the complexity of the isomorphism problem for many classes of countable structures using techniques from an area of descriptive set theory called Borel equivalence relations. In this talk we shall describe some recent results in Borel equivalence relations, as well as a couple of interactions with model theory.