Southern Wisconsin Logic Colloquium

SWLC Schedule

Refreshments will be served in the 9th floor lounge a half hour before talks. Please check the schedule below. All talks will be in 901 Van Vleck Hall unless stated otherwise.

Date Time Speaker Title Cookies,
dinner, etc.
Tuesday, April 22 4:00 p.m. Judy Goldsmith, University of Kentucky, Lexington Roles and Teams Hedonic Games (see abstract) cookies/ beverages at 3:30/
dinner at 6 at
Himal Chuli Restaurant
(318 State St.)
Tuesday, April 29
(Midwest Computability Seminar,
University of Chicago)
1:00 p.m. TBA TBA depart at 8:30 a.m.
from Van Vleck
loading dock/
lunch at noon in Ryerson/
dinner at 6 TBA
2:30 p.m. TBA TBA
4:00 p.m. TBA TBA
Wednesday, April 30 3:30 p.m./
room B131
Paul Tveite, UW TBA (specialty exam)  
Thursday, May 1 4:00 p.m./
room B239
Ashutosh Kumar, UW TBA (thesis defense)  
Tuesday, May 6 4:00 p.m. Rutger Kuyper, Radboud University of Nijmegen, Netherlands TBA cookies/ beverages at 3:30/
dinner at 6 TBA
Wednesday, May 7 3:30 p.m./
room B131
Brian Rice, UW The Thin Set Theorem for pairs and substructures of the Muchnik lattice (thesis defense)  
Thursday, May 8 TBA Mushfeq Khan, UW TBA (thesis defense)  
Tuesday, May 13 4:00 p.m. Anush Tserunyan, University of Illinois at Urbana-Champaign TBA cookies/ beverages at 3:30/
dinner at 6 TBA

Math 873 - Spring 2014 - On the length of Borel hierarchies

Instructor: Arnie Miller

Course Description: I will be talking about the length of Borel hierarchies.

My interest in this topic started with my thesis in 1979:

On the length of Borel hierarchies
Annals of Math Logic, 16(1979), 233-267.

and continues to this day:

Universal Functions
(with P.Larson, J.Steprans, W.Weiss)
eprint Apr 2012 last revised Feb 2013.

There is no textbook, however see:
Descriptive Set Theory and Forcing: How to prove theorems about Borel sets the hard way
Lecture Notes in Logic 4(1995), Springer-Verlag.

Math 975 - Reading Seminar in Logic

Our reading seminar is meeting on Wednesdays at 3:30 in room B131 Van Vleck Hall.

Abstracts of talks

Goldsmith's talk: Roles and Teams Hedonic Games

Hedonic coalition formation games are characterized by agents who have preferences only about their own coalition, not about the overall partition of agents into coalitions. Consider mission assignments, where the size of the mission is limited by the number of seats in a vehicle. I might prefer a team consisting of an astrogator, an engineer, and a programmer, but only if I were the astrogator. We introduce Roles and Teams Hedonic Games (RTHGs), in which agents have preferences over both the composition of their team and their assigned role within that composition. In this talk, I will define RTHGs and notions of optimization and stability for RTHGs, and give other applications. I will present computational complexity results for optimization and stability, and experimental results for heuristic solvers. This is joint work with Matthew Spradling.


Prepared by Steffen Lempp (@math.wisc.edu">lemppmath.wisc.edu)