[Settfa] Tuesday 25/04, Karol Duda

[kubis at math.cas.cz]

 ------------------------------------------------------------------------- 

 Tuesday 25th April, 10:00am 
 
  Place: IM in konírna 

 
    ------------------------------------------------------------------------- 

 Speaker:Karol Duda, University of Wroclaw, Poland
 Title: Computability of amenability and paradoxical decompositions

 Abstract  

 The talk will focus on computable aspects of amenability. In the main part of the talk we will discuss our results concerning computable paradoxical decompositions. They are based on computable versions of Hall's Harem Theorem.


 For more information see the seminar web page at 
 https://calendar.math.cas.cz/set-theory-and-analysis-actual .