Logic Seminar
Building 15, Room 131
A recursion theoretic property of analytic equivalence relations
Howard Becker,
Visiting Caltech,
Let E be an analytic equivalence relation which does not have perfectly many equivalence classes. For any oracle a, define L(a,E) to be the set of E-equivalence classes which contain an element y with the property that omega_1^ = omega_1^a. For a Turing cone of a's, L(a,E) is countable.
For more information, please contact Mathematics Department by phone at 626-395-4335 or by email at [email protected].
Event Series
Logic Seminar Series
Event Sponsors