skip to content
 

Computable analysis and games in descriptive set theory

Presented by: 
H Nobrega Universiteit van Amsterdam
Date: 
Friday 9th October 2015 - 12:30 to 13:25
Venue: 
INI Seminar Room 2
Abstract: 
We report on ongoing work with Arno Pauly, showing how concepts from computable analysis can be used to shed light and uniformize certain games for classes of functions which have been studied in descriptive set theory, such as Wadge's game for continuous functions, Duparc's eraser game for Baire class 1 functions, and Semmes' tree game for Borel functions.

As an application, for each finite n we obtain a game characterizing the Baire class n of functions.

The video for this talk should appear here if JavaScript is enabled.
If it doesn't, something may have gone wrong with our embedded player.
We'll get it fixed as soon as possible.
University of Cambridge Research Councils UK
    Clay Mathematics Institute London Mathematical Society NM Rothschild and Sons