Higher Recursion Theory

Informationen zum Autor Gerald E. Sacks works in the Department of Mathematics at Harvard University, Massachusetts and at the Massachusetts Institute of Technology. Klappentext This almost self-contained introduction to higher recursion theory is essential reading for all researchers in the field. Zusammenfassung This introduction to higher recursion theory is essential reading for all researchers in the field. It is divided into four parts: hyperarithmetic sets, metarecursion, a-recursion, and E-recursion. Inhaltsverzeichnis 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.

Product details

• Authors: Gerald E. Sacks, Gerald E. (Harvard University Sacks, GeraldE Sacks
• Publisher: Cambridge University Press ELT
• Languages: English
• Product format: Hardback
• Released: 02.03.2017
• EAN: 9781107168435
• ISBN: 978-1-107-16843-5
• No. of pages: 360
• Series: Perspectives in Logic
• Subject: Natural sciences, medicine, IT, technology > Mathematics > General, dictionaries