Home /  MT Research Seminar: Relative computability of models of a strongly minimal theory.

Seminar

MT Research Seminar: Relative computability of models of a strongly minimal theory. March 11, 2014 (01:30 PM PDT - 03:00 PM PDT)
Parent Program:
Location: SLMath: Eisenbud Auditorium
Speaker(s) Uri Andrews (University of Wisconsin-Madison)
Description No Description
Keywords and Mathematics Subject Classification (MSC)
Primary Mathematics Subject Classification No Primary AMS MSC
Secondary Mathematics Subject Classification No Secondary AMS MSC
Video
No Video Uploaded
Abstract/Media

We show that if a strongly minimal theory has one recursive model then every model is recursive in 0^(3). In a special cases we can lower this bound to 0^(2). This answers a long-standing open question in recursive model theory. The analysis uses both model theoretic ideas as well as some recursion theoretic techniques. I will try to explain this interplay without assuming recursion theory knowledge beyond the existence of a Halting set, whose role I will briefly review.  (Work joint with Julia F. Knight)

No Notes/Supplements Uploaded No Video Files Uploaded