University of Cambridge > > Isaac Newton Institute Seminar Series > Computable analysis and games in descriptive set theory

Computable analysis and games in descriptive set theory

Add to your list(s) Download to your calendar using vCal

If you have a question about this talk, please contact webseminars.

Mathematical, Foundational and Computational Aspects of the Higher Infinite

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.

This talk is part of the Isaac Newton Institute Seminar Series series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.


© 2006-2023, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity