For more information about this meeting, contact Stephen Simpson, Jan Reimann.
|Title:||Forcing for basis theorems|
|Speaker:||John Pardo, Pennsylvania State University|
|The technique of forcing, primarily known for its applications in set theory, has proven to be quite useful in computability theory as well. I will discuss how forcing is made effective in the computable sense, as well as use this technique to prove the Low Basis Theorem, the Hyperimmune Free Basis Theorem, and the Cone Avoidance Basis Theorem, all of which are due to Jockusch and Soare.|
Room Reservation Information
|Date:||09 / 03 / 2013|
|Time:||02:30pm - 03:45pm|