Syllabus
- Arithmetical forcing, 1-generic and n-generic sets and their properties.
- Arithmetical hierarchy of classes of sets.
- Classes of infinite branches of computable trees.
- Low basis theorem.
- Diagonally noncomputable functions.
- Degrees of complete extensions of Peano arithmetic
- Priority methods of constructions of computably enumerable sets.
Annotation
Advanced course on computability theory. Arithmetical hierarchy of classes of sets.
Diagonally nonrecursive functions. Arithmetical forcing.
Computably enumerable sets, priority methods.