Set theory and algebraic topology
Set theory and algebraic topology
Brooke-Taylor, A (University of Bristol)Friday 18th December 2015 - 13:30 to 14:30
23 Dec 2015
•
57mins
Another proof of the Jayne-Rogers theorem
Another proof of the Jayne-Rogers theorem
Miller, B (Universität Wien)Friday 18th December 2015 - 10:00 to 11:00
23 Dec 2015
•
1hr 2mins
Borel Matchings and equidecompositions
Borel Matchings and equidecompositions
Marks, A [CALTECH (California Institute of Technology)]Friday 18th December 2015 - 11:30 to 12:30
23 Dec 2015
•
59mins
Determinacy in Infinite Matroids
Determinacy in Infinite Matroids
Bowler, N (Universität Hamburg)Thursday 17th December 2015 - 14:45 to 15:45
23 Dec 2015
•
54mins
Most Popular Podcasts
The Joe Rogan Experience
TED Talks Daily
The Tim Ferriss Show
The Daily
Stuff You Should Know
Oprah's SuperSoul Conversations
Armchair Expert with Dax Shepard
Pairwise Sums in the Reals
Pairwise Sums in the Reals
Leader, I (University of Cambridge)Thursday 17th December 2015 - 16:00 to 17:00
23 Dec 2015
•
50mins
An Introduction to infinite matroids
An Introduction to infinite matroids
Carmesin, J (University of Cambridge)Thursday 17th December 2015 - 13:30 to 14:30
23 Dec 2015
•
57mins
Context-Dependent Deterministic Parallel Feedback Turing Computability
Context-Dependent Deterministic Parallel Feedback Turing Computability
Lubarsky, B (Florida Atlantic University)Thursday 17th December 2015 - 11:30 to 12:30
23 Dec 2015
•
1hr 1min
Long and short recursive constructions---cardinal invariants and parametrized diamonds
Long and short recursive constructions---cardinal invariants and parametrized diamonds
Hrusak, M [Universidad Nacional Autónoma de México (UNAM)]Wednesday 16th December 2015 - 15:00 to 16:00
21 Dec 2015
•
55mins
Computing beyond Constructibility: The Recognizability Strength of Ordinal Time Machines
Computing beyond Constructibility: The Recognizability Strength of Ordinal Time Machines
Carl, M (Universität Konstanz)Wednesday 16th December 2015 - 13:30 to 14:30
21 Dec 2015
•
57mins
Well-quasi-orderings for progam analysis and computational complextiy
Well-quasi-orderings for progam analysis and computational complextiy
Schnoebelen, P [CNRS (Centre national de la recherche scientifique)]Wednesday 16th December 2015 - 10:00 to 11:00
21 Dec 2015
•
1hr
