Turing Categories and Realizability

atmire.migration.oldid5415
dc.contributor.advisorCockett, Robin
dc.contributor.authorNester, Chad
dc.contributor.committeememberEberly, Wayne
dc.contributor.committeememberZach, Richard
dc.contributor.committeememberWoodrow, Robert
dc.contributor.committeememberCockett, Robin
dc.date.accessioned2017-04-06T22:14:18Z
dc.date.available2017-04-06T22:14:18Z
dc.date.issued2017
dc.date.submitted2017en
dc.description.abstractWe 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.en_US
dc.identifier.citationNester, C. (2017). Turing Categories and Realizability (Master's thesis, University of Calgary, Calgary, Canada). Retrieved from https://prism.ucalgary.ca. doi:10.11575/PRISM/28534en_US
dc.identifier.doihttp://dx.doi.org/10.11575/PRISM/28534
dc.identifier.urihttp://hdl.handle.net/11023/3689
dc.language.isoeng
dc.publisher.facultyGraduate Studies
dc.publisher.institutionUniversity of Calgaryen
dc.publisher.placeCalgaryen
dc.rightsUniversity 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.
dc.subjectMathematics
dc.subjectComputer Science
dc.subject.otherCategory Theory
dc.subject.otherComputability
dc.subject.otherRealizability
dc.titleTuring Categories and Realizability
dc.typemaster thesis
thesis.degree.disciplineComputer Science
thesis.degree.grantorUniversity of Calgary
thesis.degree.nameMaster of Science (MSc)
ucalgary.item.requestcopytrue
Files