For more information about this meeting, contact Jan Reimann, Stephen Simpson.
| Title: | Slaman-Woodin Coding (I) |
|---|---|
| Seminar: | Logic Seminar |
| Speaker: | Adrian Maler, Pennsylvania State University |
| Abstract: | |
| The talk presents a theorem, due to Slaman and Woodin, that every countable relation is uniformly definable in the structure of the Turing degrees. | |
Room Reservation Information
| Room Number: | MB315 |
|---|---|
| Date: | 02 / 07 / 2012 |
| Time: | 02:30pm - 03:45pm |