COOKIES: By using this website you agree that we can place Google Analytics Cookies on your device for performance monitoring. |
University of Cambridge > Talks.cam > Isaac Newton Institute Seminar Series > Around the definability of mad families
Around the definability of mad familiesAdd to your list(s) Download to your calendar using vCal
If you have a question about this talk, please contact webseminars. Mathematical, Foundational and Computational Aspects of the Higher Infinite I will talk about my new proof that there are no analytic infinite mad (maximal almost disjoint) families of subsets of $omega$, 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 $omega$ and other types of mad families, such as eventually different families of functions from $omega$ to $omega$, and why these problems may be very different from the situation presented by mad families of subsets of $omega$. This talk is part of the Isaac Newton Institute Seminar Series series. This talk is included in these lists:
Note that ex-directory lists are not shown. |
Other listsAll Talks (aka the CURE list) SciBar Type the title of a new list here Armourers and Brasiers Cambridge Forum CUID Tackling Obesity with Big Data: methods & models - One Day SeminarOther talksGroup covariance functions for Gaussian process metamodels with categorical inputs Optimising fresh produce quality monitoring and analysis Intrinsically Motivating Teachers;STIR's use of Data Driven Insight to Iterate, Pivot and (where necessary) Fail Fast South American Opuntioids Public innovation: can innovation methods help solve social challenges? Changing languages in European Higher Education: from official policies to unofficial classroom practices |