Higher Recursion Theory
Higher Recursion Theory
Cambridge University Press
03/2017
360
Dura
Inglês
9781107168435
730
Descrição não disponível.
Part I. Hyperarithmetic Sets: 1. Constructive ordinals and \prod_1^1 sets; 2. The hyperarithmetic hierarchy; 3. \Sigma_1^1 predicates of reals; 4. Measure and forcing; Part II. Metarecursion: 5. Metarecursive enumerability; 6. Hyperregularity and priority; Part III. -Recursion: 7. Admissibility and regularity; 8. Priority arguments; 9. Splitting, density and beyond; Part IV. E-Recursion: 10. E-closed structures; 11. Forcing computations to converge; 12. Selection and k-sections; 13. E-recursively enumerable degrees; Bibliography; Subject index.
Este título pertence ao(s) assunto(s) indicados(s). Para ver outros títulos clique no assunto desejado.
Part I. Hyperarithmetic Sets: 1. Constructive ordinals and \prod_1^1 sets; 2. The hyperarithmetic hierarchy; 3. \Sigma_1^1 predicates of reals; 4. Measure and forcing; Part II. Metarecursion: 5. Metarecursive enumerability; 6. Hyperregularity and priority; Part III. -Recursion: 7. Admissibility and regularity; 8. Priority arguments; 9. Splitting, density and beyond; Part IV. E-Recursion: 10. E-closed structures; 11. Forcing computations to converge; 12. Selection and k-sections; 13. E-recursively enumerable degrees; Bibliography; Subject index.
Este título pertence ao(s) assunto(s) indicados(s). Para ver outros títulos clique no assunto desejado.