Unifying exact completions
Category Theory
2012-12-06 v1 Logic in Computer Science
Logic
Abstract
We define the notion of exact completion with respect to an existential elementary doctrine. We observe that the forgetful functor from the 2-category exact categories to existential elementary doctrines has a left biadjoint that can be obtained as a composite of two others. Finally, we conclude how this notion encompasses both that of the exact completion of a regular category as well as that of the exact completion of a cartesian category with weak pullbacks.
Cite
@article{arxiv.1212.0966,
title = {Unifying exact completions},
author = {Maria Emilia Maietti and Giuseppe Rosolini},
journal= {arXiv preprint arXiv:1212.0966},
year = {2012}
}
Comments
9 pages