The picnic is being organized by Turbo Ho, Reese Johnston and Paul Tveite. Please email Turbo (email@example.com) to let us know how many will be in your party and whether you can give or need a ride. We will leave from the Van Vleck loading dock at noon; please do not drive directly to Devil's Lake unless your car is full so that everyone can get a ride.
As usual, brats, burgers, vegetarian alternatives and drinks will be provided courtesy of the UW logic faculty. Please bring a salad or dessert to share.
|Tuesday, April 28||4:00 p.m.||Iván Ongay Valverde, UW||ℵ1-dense sets of reals (specialty exam, see abstract)||cookies/juice|
|Tuesday, May 5||4:00 p.m.||Ethan McCarthy, UW||TBA (specialty exam)||cookies/juice|
|Tuesday, September 8||4:00 p.m.||TBA||TBA||cookies/juice|
|Tuesday, September 15||4:00 p.m.||TBA||TBA||cookies/juice|
|Tuesday, September 22||4:00 p.m.||TBA||TBA||cookies/juice|
|Tuesday, September 29||4:00 p.m.||Jerry Keisler, UW||TBA||cookies/juice|
dinner at 6
|Tuesday, October 6||4:00 p.m.||Henry Townser, University of Pennsylvania, Philadelphia||TBA||cookies/juice|
dinner at 6
Prerequisites: Math 770, and Math 773 or concurrent registration in Math 773
Time and Place: MWF 13:20-14:10
Course Description: The Medvedev and Muchnik degrees are extensions of the Turing degrees studied in computability theory. Both of these structures also have nice substructures, namely, the degrees of the so-called effectively closed sets, which form an analogue to the computably enumerable degrees studied in the Turing degrees.
We will discuss various aspects of these structures. In particular, we will cover the following topics, including their necessary prerequisites: