University of Cambridge > Talks.cam > Isaac Newton Institute Seminar Series > Happy Families and Their Relatives

  Browse A-Z

Log in

Googledetails Microsoftdetails

🔐 Log In

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

ℹ️ Information

Happy Families and Their Relatives

Download to your calendar using vCal

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

Mathematical, Foundational and Computational Aspects of the Higher Infinite

We first recall the notion of $ happy$$ families$ as well as their combinatorial properties. Then we present some families which are related to $ happy$$ families$ and investigate $ Mathias$$ forcing$ restricted to these families. In the second part we show the relation between $it Mathias$$ forcing$ and the $ Ramsey$$ property$ and discuss the still open problem whether one can take $ Mathias’$$ inaccessible$ away. In the last part, we sketch Shelah’s construction of a model of ZFC in which there are exactly $ 70$$ happy$$ ultrafilters$.

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 lists

Andrew Chamblin Memorial Lecture 2016 Chemical Engineering and Biotechnology occasional seminars Microsoft Teams (Please email npg22@cam.ac.uk for a link to the seminar)

Other talks

Title TBC Title to be confirmed Topology of the Ritz energy landscape When Programmes Disagree About Programmes: Code Poetry and the Problem of Programme–Programme Communication Title TBC Bigger Picture Talk: Developing future marine engines running on ammonia and other green fuels
 

© 2006-2025 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity