![]() |
COOKIES: By using this website you agree that we can place Google Analytics Cookies on your device for performance monitoring. | ![]() |
University of Cambridge > Talks.cam > Logic and Semantics Seminar (Computer Laboratory) > A computational method for left adjointness
A computational method for left adjointnessAdd to your list(s) Download to your calendar using vCal
If you have a question about this talk, please contact Jamie Vicary. Recently, several computational tools have been proposed for higher categories, like CaTT, Globular, cateq, etc. Paradoxically, fewer tools exist for more common 1-categories. A reason for this might be that the computational problems on 1-categories, expressed using generators and relations, do not appear as interesting as the ones on higher dimensional categories. In this talk, an alternative computational framework for 1-categories is proposed, which enables working with large categories like the categories of sets, groups, etc. As an application, a computational method for proving that (some) functors between such categories are left adjoint is introduced. In good cases, this method is fully automated as will be shown on several examples. This talk is part of the Logic and Semantics Seminar (Computer Laboratory) series. This talk is included in these lists:
Note that ex-directory lists are not shown. |
Other listsEPOC Society To Science Type the title of a new list hereOther talksStatistics Clinic Summer 2022 IV Characterizing turbulent heat transport in the ocean using machine learning Investigating the fundamental circuit pathology in schizophrenia using computational modelling of brain imaging data Democracy and Representation in Early Modern England, 1531–1653 Trauma Apps and the Making of the 'Smart' Refugee. |