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

  Browse A-Z

Log in

Googledetails Microsoftdetails

🔐 Log In

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

ℹī¸ Information

Presheaves seen as freely added colimits: an algorithmic approach

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.

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

Average on weekdays: 9200.87153652 kWh Learning The new way Queer Studies @Wolfson College

Other talks

External Seminar - Michael Raissig TBC CSAR lecture: In a post-Ozempic world, have we cured obesity? Online Causal Inference Semina Group Work The organisational management of traumatic stress Seminars in Cancer
 

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