Higher Recursion Theory

Erscheinungsjahr 2017
ISBN: 978-1-107-16843-5
Verlag: Cambridge University Press

Buch, Englisch, Band 2, 360 Seiten, Format (B × H): 161 mm x 240 mm, Gewicht: 774 g

Reihe: Perspectives in Logic

Since their inception, the Perspectives in Logic and Lecture Notes in Logic series have published seminal works by leading logicians. Many of the original books in the series have been unavailable for years, but they are now in print once again. This volume, the second publication in the Perspectives in Logic series, is an almost self-contained introduction to higher recursion theory, in which the reader is only assumed to know the basics of classical recursion theory. The book is divided into four parts: hyperarithmetic sets, metarecursion, a-recursion, and E-recursion. This text is essential reading for all researchers in the field.

Autoren/Hrsg.

Sacks, Gerald E.

Fachgebiete

• Mathematik | Informatik EDV | Informatik Informatik Mathematik für Informatiker
• Mathematik | Informatik Mathematik Algebra Zahlentheorie
• Mathematik | Informatik Mathematik Mathematik Allgemein Mathematische Logik
• Mathematik | Informatik Mathematik Mathematik Allgemein Grundlagen der Mathematik

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. a-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.

Über Autor(innen)

Sacks, Gerald E.
Gerald E. Sacks works in the Department of Mathematics at Harvard University, Massachusetts and at the Massachusetts Institute of Technology.