University of Cambridge > Talks.cam > Isaac Newton Institute Seminar Series > Univalent type theory and modular formalisation of mathematics

Univalent type theory and modular formalisation of mathematics

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

If you have a question about this talk, please contact info@newton.ac.uk.

BPR - Big proof

 In the first part of the talk, I will try to compare the way mathematical collectionsare represented in set theory, simple type theory, dependent type theory and finallyunivalent type theory. The main message is that the univalence axiom is a strongform of extensionality, and that extensionality axiom is important for modularisationof concepts and proofs. The goal of this part is to explain to people familiar to simpletype theory why it might be interesting to extend this formalism with dependent types and the univalence axiom. 
The second part will try to explain in what way we can see models of univalent typetheory as generalisations of R. Gandy’s relative consistency proof of the extensionalityaxioms for simple type theory.

This talk is part of the Isaac Newton Institute Seminar Series series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

 

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