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:20261101T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:6af48f8564762
DTSTART;TZID=America/Toronto:20261112T133000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20261112T150000
URL:https://uwaterloo.ca/pure-mathematics/events/computability-learning-sem
 inar-beining-mu-goncharovs-theorem
SUMMARY:Computability Learning Seminar | Beining Mu | Goncharov's theorem a
 nd\napplication
CLASS:PUBLIC
DESCRIPTION:BEINING MU (UNIVERSITY OF WATERLOO)\n\n_Goncharov's theorem and
  application_\n\nIn this seminar\, we will prove Goncharnov's theorem\, wh
 ich states that\nthere is a structure which is computably categorical but 
 not\nrelatively so. Then we will proof its application in computable\nstru
 cture theory. In particular\, we will relativize Goncharnov's\ntheorem to 
 \\(\\emptyset'\\)\n\nMC 5403
DTSTAMP:20261111T155341Z
END:VEVENT
END:VCALENDAR