BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:An effective classification of Borel Wadge classes - Noam Greenber
 g (Victoria University of Wellington)
DTSTART:20220607T080000Z
DTEND:20220607T090000Z
UID:TALK174791@talks.cam.ac.uk
DESCRIPTION:In 1983\, Louveau completed the work started by Wadge in his t
 hesis\, and gave a complete classification of Borel Wadge classes. Later\,
  Louveau and Saint-Raymond used this classification to give a proof of Bor
 el Wadge determinacy in second-order arithmetic.&nbsp\;\nWe describe how t
 o give an effective and streamlined classification. Being dynamic in spiri
 t\, we consider names of Borel sets as decision processes (or approximatio
 n) for membership\, rather than static descriptions of classes as being bu
 ilt from simpler classes using Boolean operations.&nbsp\;\nJoint with Matt
 hew Harrison-Trainor and Dan Turetsky
LOCATION:Seminar Room 1\, Newton Institute
END:VEVENT
END:VCALENDAR