BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//UM//UM*Events//EN
CALSCALE:GREGORIAN
BEGIN:VTIMEZONE
TZID:America/Detroit
TZURL:http://tzurl.org/zoneinfo/America/Detroit
X-LIC-LOCATION:America/Detroit
BEGIN:DAYLIGHT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:EDT
DTSTART:20070311T020000
RRULE:FREQ=YEARLY;BYMONTH=3;BYDAY=2SU
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:EST
DTSTART:20071104T020000
RRULE:FREQ=YEARLY;BYMONTH=11;BYDAY=1SU
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTAMP:20230918T102503
DTSTART;TZID=America/Detroit:20230913T130000
DTEND;TZID=America/Detroit:20230913T143000
SUMMARY:Workshop / Seminar:Logic Seminar: Treeing Borel quasi-trees
DESCRIPTION:We give an introduction to descriptive combinatorics: the study of \"definable\" graphs\, colorings\, set families\, etc. on nice topological spaces such as the reals. We then present one concrete result in this area\, showing that every definable graph whose components are \"approximately tree-like\" may be turned into a genuine forest with the same components in a definable manner. This is joint work with Antoine Poulin\, Ran Tao\, and Anush Tserunyan.
UID:112056-21828378@events.umich.edu
URL:https://events.umich.edu/event/112056
CLASS:PUBLIC
STATUS:CONFIRMED
CATEGORIES:Mathematics
LOCATION:East Hall - 4088
CONTACT:
END:VEVENT
END:VCALENDAR