LFCS Seminar Friday 27th June: John Longley

Title: The Dialectica interpretation

Abstract: This talk is the 2nd 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 2 will cover the following material:


Extracting T programs from classical proofs. Examples and
applications in proof theory.

Spector's extension to full second-order arithmetic using bar
induction.