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:20190310T070000
END:DAYLIGHT
BEGIN:STANDARD
TZNAME:EST
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
DTSTART:20181104T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:6a246f7becf26
DTSTART;TZID=America/Toronto:20190808T100000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20190808T100000
URL:https://uwaterloo.ca/pure-mathematics/events/computability-learning-sem
 inar-104
SUMMARY:Computability Learning Seminar
CLASS:PUBLIC
DESCRIPTION:LUKE MACLEAN\, DEPARTMENT OF PURE MATHEMATICS\, UNIVERSITY OF W
 ATERLOO\n\n\"Effectively defining formulas in Robinson's Arithmetic\"\n\nI
 t was proven by Alfred Tarski that all general recursive functions\nare de
 finable in Robinson's Arithmetic. I will give his proof of this\nfact with
  supplementary information on how to make the process of\nfinding the defi
 ning formula effective.\n\nMC 5479
DTSTAMP:20260606T190531Z
END:VEVENT
END:VCALENDAR