Advanced Mathematical Logic IV: Computability Theory

Advanced Mathematical Logic IV: Computability Theory

Relative recursion; Turing reducibility, structure of Turing degrees; structure of the recursively enumerable degrees and priority arguments; recursion in higher types; generalized recursion; Borel and projective sets; determinacy.
Prereq: 5051 (649) or permission of department. Not open to students with credit for 747.

Textbook

Title: No text required.