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 > Saturated Boolean Ultrapowers
Saturated Boolean UltrapowersAdd 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 In this talk I will survey the general theory of Boolean ultrapowers, starting from the beginnings and including many applications and some possible future developments. Also, the set-theoretic approach to Boolean ultrapowers, due to recent work of Hamkins and Seabold, will be discussed. First developed by Mansfield as a purely algebraic construction, Boolean ultrapowers are a natural generalization of usual power-set ultrapowers. More specifically, I will focus on how some combinatorial properties of a ultrafilter U are related to the realization of types in the resulting Boolean ultrapower. Many results on $lambda$-regular and $lambda$-good ultrafilters, mostly due to Keisler, can be generalized to this context. In particular, I will sketch the construction of a $lambda$-good ultrafilter on the Levy collapsing algebra $mathrm{Coll}(lambda, 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 listsBeyond i.i.d. in Information Theory Work Shop One Day Meeting - 6th Annual Symposium of the Cambridge Computational Biology Institute Centre for English Legal History seminars ee287's list Geometry, Integrability and Twistor TheoryOther talksComputational Neuroscience Journal Club How to Design a 21st Century Economy - with Kate Raworth Flow Cytometry Diagnostics and patient pathways in pancreatic cancer Kiwi Scientific Acceleration on FPGA Climate Change: Engaging Youth |