Generalized Recursion Theory II (eBook)

Front Cover 1
Generalized Recursion Theory II 4
Copyright Page 5
Table of Contents 8
Preface 6
Chapter 1. Monotone quantifiers and admissible sets 10
Chapter 2. The continuous functionals and 2E 48
Chapter 3. Recursion theory and set theory: A marriage of convenience 64
Chapter 4. On the foundation of general recursion theory: Computations versus inductive definability 108
Chapter 5. An introduction to ß-recursion theory 120
Chapter 6. Negative solutions to Post's problem, I 136
Chapter 7. The intrinsic recursion theory on the countable or continuous functionals 144
Chapter 8. Spector second order classes and reflection 156
Chapter 9. Recursive functionals and quantifiers of finite types revisited I 194
Chapter 10. Lattices of a-recursively enumerable sets 232
Chapter 11. High a-recursively enumerable degrees 248
Chapter 12. Extendability of ZF models in the von Neuman hierarchy to models of KM theory of classes 280
Chapter 13. On the role of the successor function in recursion theory 292
Chapter 14. Set recursion 312
Chapter 15. A non-adequate admissible set with a good degree-structure 330
Chapter 16. On the EA-sentences of a-recursion theory 340
Chapter 17. Short course on admissible recursion theory 364
Chapter 18. Weakly inadmissible recursion theory 400
Chapter 19. The 1-section of a non-normal type-2 objects 416