Analysing Goedel’s T by means of ordinal assignment and collapsing

Add to your list(s) Download to your calendar using vCal

• Gunnar Wilken, Okinawa Institute of Science and Technology
• Friday 16 September 2016, 14:00-15:00
• SS03.

If you have a question about this talk, please contact Dominic Mulligan.

NOTE NON-STANDARD ROOM BOOKING

The variant of Goedel’s system T of primitive recursive functionals of finite type which is based on typed lambda-calculus can be seen as a paradigm for higher order rewrite systems.

In an article joint with A.Weiermann (LMCS 2012) T was analyzed using an assignment technique extending Howard’s original assignment from 1970. In my talk I am going to explain this technique under two aspects: the non-unique assignment needed in the argument, which goes back to Howard’s original treatment, and Weiermann’s collapsing technique, which allowed for a derivation lengths classification of T.

This talk is part of the Logic and Semantics Seminar (Computer Laboratory) series.

This talk is included in these lists:

• All Talks (aka the CURE list)
• Cambridge talks
• Computing and Mathematics
• Department of Computer Science and Technology talks and seminars
• Interested Talks
• Logic and Semantics Seminar (Computer Laboratory)
• SS03
• School of Technology
• Trust & Technology Initiative - interesting events
• bld31
• yk373's list

Note that ex-directory lists are not shown.