\documentclass[11pt,twoside,openany]{book}
\usepackage[T1]{fontenc}
\usepackage{amsmath,amsthm,amssymb,mathtools}
\usepackage{mathpazo}
\usepackage[paperwidth=6.8in,paperheight=9.7in,inner=.84in,outer=.74in,top=.8in,bottom=.84in,headheight=14pt]{geometry}
\usepackage{microtype,booktabs,etoolbox,emptypage}
\usepackage{tikz,tikz-cd}
\usetikzlibrary{arrows.meta,positioning,calc,fit,shapes.geometric,backgrounds,decorations.pathreplacing}
\usepackage{caption}
\usepackage{makeidx}
\definecolor{ink}{HTML}{1A344A}
\definecolor{accent}{HTML}{23766B}
\definecolor{soft}{HTML}{E6F2EE}
\captionsetup{font=small,labelfont=bf,labelsep=period}
\usepackage[hidelinks,bookmarksnumbered]{hyperref}
\hypersetup{pdftitle={Higher Categorical Recursion Theory},pdfsubject={Hyperarithmetic, admissible, and set recursion in higher categories},pdflang={en}}
\makeindex
\setcounter{tocdepth}{1}
\makeatletter
\patchcmd{\l@chapter}{1.5em}{2.4em}{}{}
\renewcommand*\l@section{\@dottedtocline{1}{2.4em}{3.7em}}
\makeatother
\setlength{\emergencystretch}{2em}
\setlength{\parskip}{0pt}
\raggedbottom
\clubpenalty=9000
\widowpenalty=9000
\renewcommand{\thechapter}{\Roman{chapter}}
\renewcommand{\thepart}{\Alph{part}}
\newtheorem{theorem}{Theorem}[chapter]
\newtheorem{lemma}[theorem]{Lemma}
\newtheorem{proposition}[theorem]{Proposition}
\newtheorem{corollary}[theorem]{Corollary}
\theoremstyle{definition}
\newtheorem{definition}[theorem]{Definition}
\newtheorem{example}[theorem]{Example}
\newtheorem{exercise}{Exercise}[chapter]
\theoremstyle{remark}
\newtheorem{remark}[theorem]{Remark}
\newcommand{\doi}[1]{\href{https://doi.org/#1}{\mbox{doi:\,#1}}}
\tikzset{bookbox/.style={draw=ink,rounded corners=2pt,minimum height=7mm,inner sep=5pt,align=center},
bookarr/.style={-{Stealth[length=2mm]},semithick,draw=ink},
booksite/.style={bookbox,fill=soft},
booknote/.style={font=\small,text=ink,align=center}}
\pdfstringdefDisableCommands{\def\alpha{alpha}\def\omega{omega}\def\infty{infinity}\def\Sigma{Sigma}\def\Pi{Pi}\def\mathcal#1{#1}}
\newcommand{\solution}[2]{%
\par\addvspace{.85\baselineskip}\noindent
\textbf{\hyperref[ex:#1]{#1}. #2}\enspace\ignorespaces}
\newcommand{\solutiongroup}[3]{%
\section*{Chapter #1\enspace #2}%
\phantomsection\label{solutions:#1}%
\addcontentsline{toc}{section}{#1. #2}%
\input{solutions/#3}}
\begin{document}
\frontmatter
\begin{titlepage}
\thispagestyle{empty}
\vspace*{1.03in}
\begin{flushleft}
{\color{ink}\fontsize{34}{39}\selectfont Higher Categorical\\
Recursion Theory\par}
\vspace{.38in}
{\Large Effective trees, admissible computation,\\
and homotopy-coherent witnesses\par}
\vspace{.45in}
{\color{accent}\rule{.65\linewidth}{.7pt}}\par
\vspace{.28in}
{\normalsize Manuscript prepared for \emph{Higher Categorical Semantics}\par}
\end{flushleft}
\vfill
{\small November 2026\par}
\end{titlepage}
\input{preface}
\tableofcontents
\mainmatter
\part{Effective trees and inductive definitions}
\input{chapters/01-families}
\input{chapters/02-trees}
\input{chapters/03-hyperarithmetic}
\input{chapters/04-induction}
\input{chapters/05-forcing}
\part{Admissibility, approximation, and degrees}
\input{chapters/06-admissible}
\input{chapters/07-relative}
\input{chapters/08-priority}
\input{chapters/09-degrees}
\part{Set recursion and higher descent}
\input{chapters/10-set-recursion}
\input{chapters/11-selection-forcing}
\input{chapters/12-descent}
\input{chapters/13-oracles}
\input{solutions/all}
\backmatter
\input{references}
\clearpage
\phantomsection
\addcontentsline{toc}{chapter}{Index}
\printindex
\end{document}
Original LaTeX source
Higher Categorical Recursion Theory
End of manuscript · Back to top ↑