Univalent type theory and modular formalisation of mathematics
55 mins 33 secs,
251.70 MB,
WebM
640x360,
29.97 fps,
44100 Hz,
618.63 kbits/sec
Share this media item:
Embed this media item:
Embed this media item:
About this item
| Description: |
Coquand, T
Tuesday 27th June 2017 - 11:00 to 12:00 |
|---|
| Created: | 2017-07-20 09:39 |
|---|---|
| Collection: | Big proof |
| Publisher: | Isaac Newton Institute |
| Copyright: | Coquand, T |
| Language: | eng (English) |
| Distribution: |
World
(downloadable)
|
| Explicit content: | No |
| Aspect Ratio: | 16:9 |
| Screencast: | No |
| Bumper: | UCS Default |
| Trailer: | UCS Default |
| 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. |
|---|---|
Available Formats
| Format | Quality | Bitrate | Size | |||
|---|---|---|---|---|---|---|
| MPEG-4 Video | 640x360 | 1.91 Mbits/sec | 795.61 MB | View | Download | |
| WebM * | 640x360 | 618.63 kbits/sec | 251.70 MB | View | Download | |
| iPod Video | 480x270 | 489.39 kbits/sec | 199.05 MB | View | Download | |
| MP3 | 44100 Hz | 249.79 kbits/sec | 101.69 MB | Listen | Download | |
| Auto | (Allows browser to choose a format it supports) | |||||