University of Cambridge > Talks.cam > Logic and Semantics Seminar (Computer Laboratory) > Analysing Goedel’s T by means of ordinal assignment and collapsing

  Browse A-Z

Log in

Googledetails Microsoftdetails

🔐 Log In

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

ℹ️ Information

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

Download to your calendar using vCal

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:

Note that ex-directory lists are not shown.

Other lists

Online via zoom & Kings Hedges Room Room 235, Alison Richard Building, 7 West Road, Cambridge, CB3 9DT Average on weekdays: 8968.47619048 kWh

Other talks

Cambridge RNA Club - ONLINE Group Work LCLU Annual Talk: The Early Aqueous Environment of Mars Inferred From Mission Lifetime Results by the Curiosity Rover at Gale Crater An AI-Assisted Proof in Spectral Geometry Paediatric Medicine and Rheumatology When Programmes Disagree About Programmes: Code Poetry and the Problem of Programme–Programme Communication
 

© 2006-2025 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity