University of Birmingham > Talks@bham > Theoretical computer science seminar > Quasitopoi and universes of propositions

  Browse A-Z

Log in

System Admin (disabled)details Birmingham usersdetails No account?details

Information on

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

Quasitopoi and universes of propositions

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

If you have a question about this talk, please contact Benedikt Ahrens.

There is a strong connection between models of type theory with a “static” universe of propositions and quasitopoi. In my talk, I will explore part of this connection by showing that a finitely complete category with a “universe of propositions” closed under existential quantification has a strong subobject classifier. This is in contrast to systems based on HoTT, where the principle of unique choice holds, and therefore propositions correspond to general subojects.

This talk is part of the Theoretical computer science seminar series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

EPS - College Research Teas Contemporary History Computer Science Lunch Time Talk Series

Other talks

TBC Provably Convergent Plug-and-Play Quasi-Newton Methods for Imaging Inverse Problems Extending the Lax type operator for finite W-algebras TBC Geometry of alternating projections in metric spaces with bounded curvature Sylow branching coefficients for symmetric groups
 

Talks@bham, University of Birmingham. Contact Us | Help and Documentation | Privacy and Publicity.
talks@bham is based on talks.cam from the University of Cambridge.