Cockett, RobinNester, Chad2017-04-062017-04-0620172017Nester, C. (2017). Turing Categories and Realizability (Master's thesis, University of Calgary, Calgary, Canada). Retrieved from https://prism.ucalgary.ca. doi:10.11575/PRISM/28534http://hdl.handle.net/11023/3689We 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.engUniversity of Calgary graduate students retain copyright ownership and moral rights for their thesis. You may use this material in any way that is permitted by the Copyright Act or through licensing that has been assigned to the document. For uses that are not allowable under copyright legislation or licensing, you are required to seek permission.MathematicsComputer ScienceCategory TheoryComputabilityRealizabilitymaster thesis10.11575/PRISM/28534