Turing Categories and Realizability
Abstract
We present a realizability tripos construction in which the usual partial combinatory algebra is replaced with a Turing category, and the category of partial functions on sets is replaced with a discrete cartesian closed restriction category. As an intermediate step we construct in this setting a restriction category of assemblies. Our constructions generalize existing constructions in the field.
Description
Keywords
Mathematics, Computer Science
Citation
Nester, C. (2017). Turing Categories and Realizability (Master's thesis, University of Calgary, Calgary, Canada). Retrieved from https://prism.ucalgary.ca. doi:10.11575/PRISM/28534