BEGIN:VCALENDAR
VERSION:2.0
PRODID:researchseminars.org
CALSCALE:GREGORIAN
X-WR-CALNAME:researchseminars.org
BEGIN:VEVENT
SUMMARY:Daniel Turetsky (Victoria University of Wellington)
DTSTART:20220120T190000Z
DTEND:20220120T200000Z
DTSTAMP:20260423T035753Z
UID:OLS/83
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/OLS/83/">Tru
 e Stages -- From Priority Arguments to Descriptive Set Theory</a>\nby Dani
 el Turetsky (Victoria University of Wellington) as part of Online logic se
 minar\n\n\nAbstract\nThe true stages machinery was conceived as a techniqu
 e for organizing complex priority constructions in computability theory\, 
 much like Ash's metatheorem.  With a little modification\, however\, it ca
 n prove remarkably useful in descriptive set theory.  Using this machinery
 \, we can obtain nice proofs of results of Wadge\, Hausdorff and Kuratowsk
 i\, and Louveau\, sometimes strengthening the result in the process.\nWith
 out getting too deep into the details\, I will give the ideas of the machi
 nery and how it applies to descriptive set theory.\n
LOCATION:https://researchseminars.org/talk/OLS/83/
END:VEVENT
END:VCALENDAR