Independent scholarship · Open accessThe monthly digest

Editorially reviewed

Higher Categorical Recursion Theory

This book develops effective trees, admissible recursion, forcing, priority, and set recursion in slices of an infinity-topos. It proves base change and descent results for computation records and gives an effective equivariant jump. It includes 26 diagrams and worked solutions to all 86 exercises.

Anonymous← All research

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

Reproducibility artifacts

Higher-Categorical-Recursion-Theory.pdf · 609,452 bytes · Download
SHA-256 e51121b4b4e8dd3caa5a854d74801f238ade58d4e85415db74799a2f808eb38e

Higher-Categorical-Recursion-Theory-source.zip · 128,346 bytes · Read in browser · Download
SHA-256 b97f2c619dfa17a75018a188eb5b1be2f7a3019f650127084e305c877bacce15

Discussion

Open a careful, constructive conversation about this note.

Comments appear after editorial approval.