Higher Recursion Theory
Gerald E. Sacks
Perspectives in Mathematical Logic, Volume 2
Berlin: Springer-Verlag, 1990.
344 pp.
Subjects:
03D55 (primary)03D60 (primary)03D65 (primary)03E15 (primary)
Permanent link to this monograph: http://projecteuclid.org/euclid.pl/1235422631
Mathmatical Reviews number (MathSciNet):
MR1080970
ISBN:3-540-19305-7
ISBN:0-387-19305-7
Copyright © 1990, Association for
Symbolic Logic.
Miscellaneous Frontmatter
Part A: Hyperarithmetic Sets
Chapter I: Constructive Ordinals and $\Pi^1_1$ Sets
3-21
Chapter II: The Hyperarithmetic Hierarchy
22-51
Chapter III: $\Sigma^1_1$ Predicates of Reals
52-87
Chapter IV: Measure and Forcing
88-112
Part B: Metarecursion
Chapter V: Metarecursive Enumerability
115-134
Chapter VI: Hyperregularity and Priority
135-148
Part C: $\alpha$-Recursion
Chapter VII: Admissibility and Regularity
151-174
Chapter VIII: Priority Arguments
175-203
Chapter IX: Splitting, Density and Beyond
204-229
Part D: E-Recursion
Chapter X: $\emph{E}$-Closed Structures
233-258
Chapter XI: Forcing Computations to Converge
259-282
Chapter XII: Selection and $\emph{k}$-Sections
283-308
Chapter XIII: $\emph{E}$-Recursively Enumerable Degrees
309-338
