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:20200308T070000
END:DAYLIGHT
BEGIN:STANDARD
TZNAME:EST
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
DTSTART:20191103T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:6a24032d4e4e1
DTSTART;TZID=America/Toronto:20200310T140000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20200310T140000
URL:https://uwaterloo.ca/pure-mathematics/events/computability-learning-sem
 inar-116
SUMMARY:Computability Learning Seminar
CLASS:PUBLIC
DESCRIPTION:LUKE MACLEAN\, DEPARTMENT OF PURE MATHEMATICS\, UNIVERSITY OF W
 ATERLOO\n\n\"Kleene's $\\mathcal{O}$\"\n\nA computable ordinal is one that
  corresponds to the order type of some\ncomputable linear well ordering. I
 t can be shown that these are a\nsubset of the countable ordinals\, but th
 ere is still an issue on how\nto name these ordinals. We would like a syst
 em of notation that allows\nus to compare two arbitrary ordinals.
DTSTAMP:20260606T112325Z
END:VEVENT
END:VCALENDAR