Southwest Wisconsin Logic Colloquium
Mathias forcing in computability
Event Details
Date
Tuesday, March 11, 2014
Time
4 p.m.
Location
901 Van Vleck Hall
Description
Peter Cholak, University of Notre Dame. We will study the complexity of the forcing relation and generic reals for Mathias forcing when we restrict E to be computable or within a fixed ideal of Turing degrees. For example, we will show that every computable Mathias n-generic computes a Cohen n-generic. The work on computable Mathias forcing is joint with Dzhafarov. Hirst and Slaman. The work on Mathias forcing and Turing ideals is joint with Dzhafarov and M. Soskova. Cookies/ beverages at 3:30
Cost
Free
Contact