Logic Seminar
Martin Koerwien
uic
The complexity of the isomorphism relation for countable models of omega-stable theories
Abstract: We compare two different notions of complexity: depth of a classifiable theory
(in the sense of S. Shelah's Classification Theory) on the one hand side and
Borel reducibility as defined by H. Friedman and L.Stanley on the other hand
side. We show how these notions are related to the classification problem for
classes of countable models of a theory and give some positive and negative
results concerning their mutual relationship.
Thursday September 20, 2007 at 4:00 PM in SEO 427