BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Drupal iCal API//EN
X-WR-CALNAME:Events items teaser
X-WR-TIMEZONE:America/Toronto
BEGIN:VTIMEZONE
TZID:America/Toronto
X-LIC-LOCATION:America/Toronto
BEGIN:DAYLIGHT
TZNAME:EDT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
DTSTART:20260308T070000
END:DAYLIGHT
BEGIN:STANDARD
TZNAME:EST
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
DTSTART:20251102T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:6a515f0d968f6
DTSTART;TZID=America/Toronto:20260716T133000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20260716T150000
URL:https://uwaterloo.ca/pure-mathematics/events/computability-learning-sem
 inar-beining-mu-degree
SUMMARY:Computability Learning Seminar | Beining Mu | Degree of categoricit
 y\nand treeable degrees
CLASS:PUBLIC
DESCRIPTION:BEINING MU\, UNIVERSITY OF WATERLOO\n\n_Degree of categoricity 
 and treeable degrees_\n\nIn this seminar\, we will discuss treeable degree
 s and degree of\ncategoricity. We will introduce past results on which deg
 rees can or\ncannot be a degree of categoricity and when degrees of catego
 ricity\ncoincide with treeable degrees. We will also introduce a notion\no
 f \\(\\Pi^0_1\\) singletons as an example of treeable degrees and their\n
 relation to degree of categoricity.\n\nMC 5403
DTSTAMP:20260710T210725Z
END:VEVENT
END:VCALENDAR