Scope
This manuscript gives a higher-categorical development of the subjects of Gerald E. Sacks’s Higher Recursion Theory. The thirteen chapters cover recursive trees and hyperarithmetic hierarchies, ramified induction and forcing, admissibility and relative computation, priority and degree structure, and set recursion and selection.
Main constructions
Indexed polynomial algebras represent successful computation records over a parameter object. Their images describe convergence. The manuscript identifies conditions for transport and descent, and separates these assertions from effective bounds on witnesses in recursive and admissible presentations. It gives a supported substitution law for reductions, examples where monodromy obstructs selection, and an explicit equivariant lift of the Turing jump whose established comparisons recover the ordinary jump degree.
Evidence and assumptions
The book uses ordinary set theory with choice in the metatheory and specifies the effective or categorical hypotheses for the results that depend on them. It includes theorem-proof expositions, worked examples, 26 mathematical figures, and worked solutions to all 86 exercises. The PDF is the complete manuscript. The LaTeX archive includes the complete source for the text, bibliography, figures, exercises, and solutions.
Preparation
The byline is Anonymous. Generative AI assisted with drafting, mathematical exposition, worked solutions, and typesetting. The manuscript distinguishes its arguments from the classical results it cites.
Source
Gerald E. Sacks, Higher Recursion Theory. Springer, 1990. Cambridge University Press reissue, 2017. https://doi.org/10.1017/9781316717301