Graph explorer

Unifying exact completions

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.

6 nodes5 linksoverview mapUnifying exact completions
6 nodes5 links
Unifying exact completions6 visible / 6 total nodes / 6 links
Co-authorshipAuthorshipAuthorshipTopic signalTopic signalTopic signalWUnifying exact completionspreprint / 2012AMaria Emilia MaiettiResearcherAGiuseppe RosoliniResearcherTLogic in Computer Science2208 worksTmath.LO1661 worksTmath.CT1150 works
PaperSignal 105 links

Unifying exact completions

preprint / 2012

Open