BEGIN:VCALENDAR
VERSION:2.0
PRODID:ILLC Website
X-WR-TIMEZONE:Europe/Amsterdam
BEGIN:VTIMEZONE
TZID:Europe/Amsterdam
X-LIC-LOCATION:Europe/Amsterdam
BEGIN:DAYLIGHT
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
TZNAME:CEST
DTSTART:19700329T020000
RRULE:FREQ=YEARLY;BYMONTH=3;BYDAY=-1SU
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
TZNAME:CET
DTSTART:19701025T030000
RRULE:FREQ=YEARLY;BYMONTH=10;BYDAY=-1SU
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:/NewsandEvents/Archives/2016/newsitem/7376/20-
May-2016-Cool-Logic-Dan-Frumin-and-Guillaume-Massa
s
DTSTAMP:20160515T000000
SUMMARY:Cool Logic, Dan Frumin and Guillaume Massa
s
ATTENDEE;ROLE=Speaker:Dan Frumin and Guillaume Mas
sas
DTSTART;TZID=Europe/Amsterdam:20160520T173000
DTEND;TZID=Europe/Amsterdam:20160520T183000
LOCATION:F1.15 ILLC seminar room, Science Park 107
, Amsterdam
DESCRIPTION:In this talk we would like to present
the Lawvere's fixed point theorem, which is a gene
ralisation of the Cantor-Russell-Turing-Gödel argu
ment in a sufficiently nice category. We will show
how it implies straightforwardly Cantor's theorem
and Russell's paradox, various versions of the Li
ar paradox. With a bit of work we will deduce Tars
ki's result about the undefinability of truth and
Gödel's incompleteness theorem, as well as results
from computability theory, such as the undecidabi
lity of the halting problem and the existence of f
ixed point combinators in λ-calculus. For more in
formation, see http://www.illc.uva.nl/coollogic/ o
r contact coollogic.uva at gmail.com
X-ALT-DESC;FMTTYPE=text/html:\n In this
talk we would like to present the Lawvere's fixed
point theorem, which is a generalisation of the Ca
ntor-Russell-Turing-Gödel argument in a suffi
ciently nice category. We will show how it implies
straightforwardly Cantor's theorem and Russell's
paradox, various versions of the Liar paradox. Wit
h a bit of work we will deduce Tarski's result abo
ut the undefinability of truth and Gödel's in
completeness theorem, as well as results from comp
utability theory, such as the undecidability of th
e halting problem and the existence of fixed point
combinators in λ-calculus.

\n \n
For more information, see http://
www.illc.uva.nl/coollogic/ or contact coollogic.uva at
gmail.com

URL:/NewsandEvents/Archives/2016/newsitem/7376/20-
May-2016-Cool-Logic-Dan-Frumin-and-Guillaume-Massa
s
END:VEVENT
END:VCALENDAR