Philip Welch

University of Bristol

Higher type recursion for infinite time Turing machines VII

Logic and Set Theory Seminar

10th June 2020, 2:00 pm – 3:30 pm
Online, zoom via

This is part of a series informal working seminars on an extension of Kleene’s early 1960’s on recursion in higher types. (This formed a central theme on the borders of set theory and recursion theory in the 60’s and early 70’s, although now unfortunately not much discussed. Amongst the main names here were Gandy, Aczel, Moschovakis, Harrington, Normann.) We aim to present a coherent version of type-2 recursion for the infinite time Turing machine model. We aim to be somewhat (but not entirely) self-contained. Basic descriptive set theory, and recursion theory, together with admissibility theory will be assumed.

Comments are closed.