Around the definability of mad families
56 mins 25 secs,
453.01 MB,
WebM
640x360,
29.97 fps,
44100 Hz,
1.07 Mbits/sec
Share this media item:
Embed this media item:
Embed this media item:
About this item
| Description: |
Törnquist, A D (Københavns Universitet)
Monday 24 August 2015, 15:00-16:00 |
|---|
| Created: | 2015-08-25 17:55 |
|---|---|
| Collection: | Mathematical, Foundational and Computational Aspects of the Higher Infinite |
| Publisher: | Isaac Newton Institute |
| Copyright: | Törnquist, A D |
| Language: | eng (English) |
| Distribution: |
World
(downloadable)
|
| Explicit content: | No |
| Aspect Ratio: | 16:9 |
| Screencast: | No |
| Bumper: | UCS Default |
| Trailer: | UCS Default |
| Abstract: | I will talk about my new proof that there are no analytic infinite mad (maximal almost disjoint) families of subsets of ω, a result originally proved by A.D.R. Mathias in his famous "Happy Families" paper. The new proof motivates a proof that there are no infinite mad families in Solovay's model. If time permits, I will also talk about the differences between mad families of subsets of ω and other types of mad families, such as eventually different families of functions from ω to ω, and why these problems may be very different from the situation presented by mad families of subsets of ω. |
|---|---|
Available Formats
| Format | Quality | Bitrate | Size | |||
|---|---|---|---|---|---|---|
| MPEG-4 Video | 640x360 | 1.94 Mbits/sec | 821.88 MB | View | Download | |
| WebM * | 640x360 | 1.07 Mbits/sec | 453.01 MB | View | Download | |
| iPod Video | 480x270 | 522.07 kbits/sec | 215.72 MB | View | Download | |
| MP3 | 44100 Hz | 249.77 kbits/sec | 103.30 MB | Listen | Download | |
| Auto | (Allows browser to choose a format it supports) | |||||