Univalent type theory and modular formalisation of mathematics

Speaker(s) Thierry Coquand Göteborgs Universitet
Date 27 June 2017 – 11:00 to 12:00
Venue INI Seminar Room 2
Session Title Univalent type theory and modular formalisation of mathematics
Event [BPR] Big proof
Abstract  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.
Presentation Files 21728_0.pdf

Supported By