University of Cambridge > Talks.cam > Logic & Semantics for Dummies > Presheaves seen as freely added colimits: an algorithmic approach

Presheaves seen as freely added colimits: an algorithmic approach

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

If you have a question about this talk, please contact Nathanael Arkor.

To characterise the equivalence relation “having the same colimit” for diagrams in a small category ℂ, we saw, last time, a “big step” approach directly yielding the canonical colimit diagram acting as a representative of the equivalence class. In this (informal again) talk, independent of the previous ones, we will focus on a “small step” approach instead, by algorithmically computing the canonical colimit diagram, which will appear as a normal form for a certain abstract rewriting system (finally giving a hopefully satisfying intuition as to why presheaves over ℂ correspond to freely added colimits in ℂ).

This talk is part of the Logic & Semantics for Dummies series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

 

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