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:20150308T070000
END:DAYLIGHT
BEGIN:STANDARD
TZNAME:EST
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
DTSTART:20141102T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:6a238d1592d8b
DTSTART;TZID=America/Toronto:20150806T140000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20150806T140000
URL:https://uwaterloo.ca/pure-mathematics/events/computability-learning-sem
 inar-8
LOCATION:M3 4206 Canada
SUMMARY:Computability Learning Seminar
CLASS:PUBLIC
DESCRIPTION:Jonny Stephenson\, Pure Mathematics\, University of Waterloo\n\
 n\"Embedding Lattices into the Computably Enumerable Degrees\"\n\nThe ques
 tion of which finite lattices can be embedded into the c.e.\ndegrees first
  arose with the construction of a minimal pair by Yates\,\nand independent
 ly by Lachlan\, showing the 4 element Boolean algebra\ncan be embedded. Th
 is result was rapidly generalised to show any\nfinite distributive lattice
  can also be embedded. For non-distributive\nlattices\, the situation is m
 ore complicated.
DTSTAMP:20260606T025933Z
END:VEVENT
END:VCALENDAR