Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

7

ACS
2015

favoriteEmaildiscussreport

17views Distributed And Parallel Com...» more ACS 2015»

Unifying Exact Completions

8 years 29 days ago

Unifying Exact Completions

Download www.math.unipd.it

We deﬁne the notion of exact completion with respect to an existential elementary doctrine. We observe that the forgetful functor from the 2category of 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 category with binary products, a weak terminal object and weak pullbacks. MSC 2000: 03G30 03B15 18C50 03B20 03F55

Maria Emilia Maietti, Giuseppe Rosolini

Real-time Traffic

ACS 2015 | Distributed And Parallel Computing |

claim paper

Related Content

» Completeness in the Boolean Hierarchy ExactFourColorability Minimal Graph Uncolorability a...

» Unifying Synchronous Tree Adjoining Grammars and Tree Transducers via Bimorphisms

» Complete Exact and Efficient Implementation for Computing the Adjacency Graph of an Arrang...

» Complete exact and efficient computations with cubic curves

» CPSPtools Exact and complete algorithms for highthroughput 3D lattice protein studies

» Exact Matrix Completion via Convex Optimization

» Exact Solutions of Completely Integrable Systems and Linear ODEs Having Elliptic Function ...

» Aspects of predicative algebraic set theory I Exact completion

» Exact efficient and complete arrangement computation for cubic curves

» Clique coverings and partitions of line graphs

Post Info
More Details (n/a)

Added	13 Apr 2016
Updated	13 Apr 2016
Type	Journal
Year	2015
Where	ACS
Authors	Maria Emilia Maietti, Giuseppe Rosolini

Comments (0)