John Longley, Topics in Computability, Lecture 1: Goedel's System T скачать в хорошем качестве

John Longley, Topics in Computability, Lecture 1: Goedel's System T

Lecture 1: Gödel's System T Slides available from John's homepage: https://homepages.inf.ed.ac.uk/jrl/Co... Abstract This talk is the 1st in a short series of 4 tutorial lectures covering some classic material from higher-order computability theory. The lectures cover classic material rather than very recent research. They contain fundamental ideas that have proved to be of enduring interest, but are perhaps not so easy to learn from books and papers. These lectures reflect some of my recent ideas for presenting this material as I work on the second edition of my book with Dag Normann on the subject. Lecture 1 will cover the following material: Motivations and historical background. Logical relations as a key proof technique: normalization and continuity results. Some surprising programs possible in T. The Berger-Schwichtenberg normalization by evaluation theorem.