The Cantor-Schröder-Bernstein Theorem for ∞-groupoids

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

• Martin Escardo (School of Computer Science)
• Thursday 06 February 2020, 12:00-13:00
• CS 217.

If you have a question about this talk, please contact Todd Waugh Ambridge.

Pradic and Brown (2019) showed that, in constructive set theory, Cantor-Schröder-Bernstein implies excluded middle. Their proof uses the compactness (or searchability or omniscience) of the set ℕ∞ of extended natural numbers.

Conversely, we show that, in Voevodsky’s univalent mathematics, excluded middle implies Cantor-Schröder-Bernstein not only for sets, but also for all homotopy types, or ∞-groupoids.

The talk will aim to be relatively self-contained, briefly explaining the relevant bits of univalent mathematics and other necessary background.

This talk is part of the Lab Lunch series.

This talk is included in these lists:

• CS 217
• Computer Science Departmental Series
• Computer Science Distinguished Seminars
• Lab Lunch
• Theoretical computer science seminar
• computer sience

Note that ex-directory lists are not shown.