Date: Thursday, March 14, 2013
Location: 2866 East Hall (4:00 PM to 5:30 PM)
Title: Fusion in Sacks Forcing
Abstract: Fusion is a technique that comes up when dealing with certain kinds of forcings. The basic idea is that we want infinitely many statements to hold in a forcing extension simultaneously, so if we delicately pick forcing conditions which force each these statements, we can "fuse" the conditions together into a single one, which witnesses all of the statements holding in a single extension. This technique is used in Sacks forcing, which is what the talk will be about. Recall that this forcing is the set of all perfect trees on the natural numbers ordered by inclusion. I will present some arguments that use fusion, including a proof that Sacks forcing has "continuous readings of names".
Speaker: Daniel Hathaway
Institution: Univ. of Michigan
Event Organizer: Andreas Blass ablass@umich.edu
|