Logic Seminar
Uri Andrews
UCBerkeley
Hrushovski Geometries Coding Non-recursive Sets.
Abstract: There is a theory which computes arithmetic, is strongly minimal, and all of its models have recursive presentations.
We will preview the Hrushovski construction and some ways to alter the construction to code non-recursive information. Then we will use an infinite worker argument to show that with these method we can code the most complicated set possibly coded in a recursive structure, namely the set of true statements in Arithmetic ($0^{\omega}$).
This talk will grow out of the more introductory Louise Hay Logic Seminar immediately preceeding it.
Thursday November 12, 2009 at 4:15 PM in SEO 612