For more information about this meeting, contact Jan Reimann, Stephen Simpson.
| Title: | Degree spectra of relations |
|---|
| Seminar: | Logic Seminar |
|---|
| Speaker: | Jennifer Chubb, University of San Francisco |
|---|
| Abstract: |
|---|
| We consider algorithmic properties of additional relations on
computable structures. For example, for a computable linear ordering
we may consider the successor relation, which does not have to be
computable. The degree spectrum of a relation on a computable
structure is the set of degrees (Turing or otherwise) of images of that
relation under classical isomorphism to another computable copy of the
structure. We will see some general theorems, examples of degree spectra of
definable relations, and will analyze the strong degree spectra of the omega-type initial segment of
computable linear orderings of type omega + omega*. |
Room Reservation Information
| Room Number: | MB315 |
|---|
| Date: | 03 / 15 / 2011 |
|---|
| Time: | 02:30pm - 03:45pm |
|---|
