Computability Theory of Hyperarithmetical Sets

Course

Lecturer:
Emanuele Frittaion (University of Udine)

Board Contact:
Alberto Marcone

SSD: MATH-01/A

CFU: 3 CFU + assignment: 2 CFU 

Period: November–December 2024

Lessons / Hours: 12 hours 

Program:

The aim of the course is to give an introduction to the theory of hyperaritmetic sets and Pi11 sets, covering the following material:

  • Sacks. Higher recursion theory. Chapters I, II, III, IV
  • Chong and Yu. Recursion theory. Computational aspects of definability. Chapters 1, 2, 3 , 4, 5

Verification: Final seminar

Prerequisites: The prerequisites for the course are some basic facts about computable functions and mathematical logic.