University of Cambridge > Talks.cam > Junior Category Theory Seminar > Regular, exact, and PERs categories

Regular, exact, and PERs categories

Add to your list(s) Download to your calendar using vCal

If you have a question about this talk, please contact Sean Moss.

There are different ways of dealing with equivalence relations and quotients. Notably:
  • Regular and exact categories: they arise naturally with many examples. Thus, their free constructions are of particular interest.
  • Categories of partial equivalence relations (PERs): they are widely used in computer science (particularly in semantics of programming languages). These notions are linked together and fall within a general framework. This provides an explanation of why all these categories are often found to be cartesian closed.
References:
  • Carboni, Celia Magno – The free exact category on a left exact one
  • Carboni, Vitale – Regular and exact completions
  • Carboni, Rosolini – Locally cartesian closed exact completions
  • Birkedal, Carboni, Rosolini, Scott – Type theory via exact categories

This talk is part of the Junior Category Theory Seminar series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

 

© 2006-2019 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity