BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Analysing Goedel’s T by means of ordinal assignment and collapsi
 ng - Gunnar Wilken\, Okinawa Institute of Science and Technology
DTSTART:20160916T130000Z
DTEND:20160916T140000Z
UID:TALK66439@talks.cam.ac.uk
CONTACT:Dominic Mulligan
DESCRIPTION:The variant of Goedel's system T of primitive recursive functi
 onals of finite type which is based on typed lambda-calculus can be seen a
 s a paradigm for higher order rewrite systems.\n\nIn an article joint with
  A.Weiermann (LMCS 2012) T was analyzed using an assignment technique exte
 nding Howard's original assignment from 1970. In my talk I am going to exp
 lain this technique under two aspects: the non-unique assignment needed in
  the argument\, which goes back to Howard's original treatment\, and Weier
 mann's collapsing technique\, which allowed for a derivation lengths class
 ification of T.
LOCATION:SS03
END:VEVENT
END:VCALENDAR