Computability models over categories

arXiv2105.06933MaRDI QIDQ6367668FDOQ6367668

Authors: Iosif Petrakis 

Publication date: 14 May 2021

Abstract: Generalising slightly the notions of a strict computability model and of a simulation between them, which were elaborated by Longley and Normann, we define canonical computability models over categories and appropriate Set-valued functors on them. We study the canonical total computability model over a category, and the partial one over a category with pullbacks. Our notions and results are generalised to categories with a base of computability, connecting Rosolini's theory of dominions with the theory of computability models.

This page was built for publication: Computability models over categories

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6367668)