Events Search and Views Navigation
November 2019
New developments on algorithmically random closed sets
Speaker: Christopher Porter (Drake University) Abstract: In this talk, I will discuss recent joint work with Adam Case on algorithmically random closed subsets of Cantor space. In earlier work, Cenzer and Weber studied the behavior of various biased random closed sets under unions and intersections, showing that these operations preserve randomness in the sense that performing such an operation on a pair of relatively random closed sets results in a closed set that is random with respect to the measure…
Find out more »December 2019
A Visit from a Ghost of Set Theory Past
Time: Thursday, December 5th at 3:30 PM Speaker: Mark Johnson (Central College) Title: A Visit from a Ghost of Set Theory Past Abstract: Given an uncountable set X in a forcing extension, what can be said about infinite subsets of X in the ground model? We explore this question for common partial orders that add reals, as well as their iterations. This work is originally from my dissertation, so I will also tell some of the story of why I'm…
Find out more »