Computability models over categories
Category Theory
2021-05-17 v1
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.
Keywords
Cite
@article{arxiv.2105.06933,
title = {Computability models over categories},
author = {Iosif Petrakis},
journal= {arXiv preprint arXiv:2105.06933},
year = {2021}
}
Comments
8 pages