Activity: Participating in or organising an event types › Invited talk
Amsterdam Workshop on Set Theory 2014 tutorial: Building κ-complete filters for supercompact κ
Abstract: When trying to generalize arguments from the omega case in which filters are constructed inductively through a forcing iteration, a common problem is to prove that κ-completeness is preserved at limit stages. If κ is supercompact, however, a technique of Dzamonja and Shelah may sometimes be used to overcome this problem. I will describe this method, focusing on the case of constructing a model with u(κ) strictly less than 2^κ.