\begin{thebibliography}{99}
\addcontentsline{toc}{chapter}{Bibliography}
\raggedright
\bibitem{Barwise}
Jon Barwise. \emph{Admissible Sets and Structures}. Springer, 1975. Cambridge University Press reissue, 2017.
\doi{10.1017/9781316717196}.
\bibitem{ChongFriedman}
Chi Tat Chong and Sy-David Friedman. Ordinal recursion theory. In \emph{Handbook of Computability Theory}, pp.~277--317. North-Holland, 1999.
\href{https://www.logic.univie.ac.at/~dsyfriedman/papers/joint.ct.ordinal.rec.pdf}{Author's copy}.
\bibitem{GambinoHyland}
Nicola Gambino and Martin Hyland. Wellfounded trees and dependent polynomial functors. In \emph{Types for Proofs and Programs}, LNCS 3085, pp.~210--225. Springer, 2004.
\href{https://doi.org/10.1007/978-3-540-24849-1_14}{Springer}.
\bibitem{HarringtonThesis}
Leo Anthony Harrington. \emph{Contributions to Recursion Theory on Higher Types}. PhD thesis, Massachusetts Institute of Technology, 1973.
\href{https://dspace.mit.edu/entities/publication/52d2ba1e-fa92-4f95-b2a4-2acf4e54d0a2}{MIT Libraries}.
\bibitem{GrilliotHM}
Leo A. Harrington and David B. MacQueen. Selection in abstract recursion theory. \emph{Journal of Symbolic Logic} 41, 153--158, 1976.
\href{https://www.cambridge.org/core/journals/journal-of-symbolic-logic/article/selection-in-abstract-recursion-theory/56BD15204AB479AEC673AA845BE8F7F9}{Publisher}.
\bibitem{Hyland}
J. Martin E. Hyland. The effective topos. In \emph{The L. E. J. Brouwer Centenary Symposium}, pp.~165--216. North-Holland, 1982.
\doi{10.1016/S0049-237X(09)70129-6}.
\bibitem{Lurie}
Jacob Lurie. \emph{Higher Topos Theory}. Princeton University Press, 2009.
\href{https://arxiv.org/abs/math/0608040}{arXiv manuscript}.
\bibitem{MosDescriptive}
Yiannis N. Moschovakis. \emph{Descriptive Set Theory}. Second edition. American Mathematical Society, 2009.
\doi{10.1090/surv/155}.
\bibitem{Normann}
Dag Normann. Set recursion. In \emph{Generalized Recursion Theory II}, pp.~303--320. North-Holland, 1978.
\doi{10.1016/S0049-237X(08)70938-8}.
\bibitem{OostenRel}
Jaap van Oosten. A general form of relative recursion. \emph{Notre Dame Journal of Formal Logic} 47, 311--318, 2006.
\doi{10.1305/ndjfl/1163775438}.
\bibitem{Sacks}
Gerald E. Sacks. \emph{Higher Recursion Theory}. Springer, 1990. Cambridge University Press reissue, 2017.
\doi{10.1017/9781316717301}.
\bibitem{InadmissibleForcing}
Gerald E. Sacks and Theodore A. Slaman. Inadmissible forcing. \emph{Advances in Mathematics} 66, 1--30, 1987.
\doi{10.1016/0001-8708(87)90028-4}.
\bibitem{ShoreUniform}
Richard A. Shore. \(\Sigma_n\) sets which are \(\Delta_n\)-incomparable (uniformly). \emph{Journal of Symbolic Logic} 39, 295--304, 1974.
\href{https://www.cambridge.org/core/journals/journal-of-symbolic-logic/article/n-sets-which-are-nincomparable-uniformly1/220DB8368938697FF5244F896D828E68}{Publisher}.
\bibitem{ShoreSplitting}
Richard A. Shore. Splitting an \(\alpha\)-recursively enumerable set. \emph{Transactions of the American Mathematical Society} 204, 65--77, 1975.
\doi{10.1090/S0002-9947-1975-0379154-1}.
\bibitem{ShoreDensity}
Richard A. Shore. The recursively enumerable \(\alpha\)-degrees are dense. \emph{Annals of Mathematical Logic} 9, 123--155, 1976.
\href{https://www.sciencedirect.com/science/article/pii/0003484376900073}{Publisher}.
\bibitem{SlamanReflection}
Theodore A. Slaman. Reflection and forcing in \(E\)-recursion theory. \emph{Annals of Pure and Applied Logic} 29, 79--106, 1985.
\doi{10.1016/0168-0072(85)90036-3}.
\bibitem{SlamanPriority}
Theodore A. Slaman. Reflection and the priority method in \(E\)-recursion theory. In \emph{Recursion Theory Week}, LNM 1141, pp.~372--404. Springer, 1985.
\doi{10.1007/BFb0076231}.
\bibitem{SlamanDensity}
Theodore A. Slaman. The \(E\)-recursively enumerable degrees are dense. In \emph{Recursion Theory}, Proc. Sympos. Pure Math. 42, pp.~195--213. American Mathematical Society, 1985.
\href{https://math.berkeley.edu/~slaman/papers/Publications.html}{Author's bibliography, item 127}.
\bibitem{Spector}
Clifford Spector. Recursive well-orderings. \emph{Journal of Symbolic Logic} 20, 151--163, 1955.
\doi{10.2307/2266902}.
\bibitem{GambinoKock}
Nicola Gambino and Joachim Kock. Polynomial functors and polynomial monads. \emph{Mathematical Proceedings of the Cambridge Philosophical Society} 154, 153--192, 2013.
\href{https://arxiv.org/abs/0906.4931}{arXiv manuscript}.
\bibitem{GepnerKock}
David Gepner and Joachim Kock. Univalence in locally cartesian closed infinity-categories. \emph{Forum Mathematicum} 29, 617--652, 2017.
\href{https://arxiv.org/abs/1208.1749}{arXiv manuscript}.
\end{thebibliography}
Original LaTeX source
Higher Categorical Recursion Theory
End of manuscript · Back to top ↑