Computable analysis and games in descriptive set theory

Duration: 44 mins 6 secs

Share this media item:

Embed this media item:

<iframe width="_width_" height="_height_" src="https://sms.cam.ac.uk/media/2090880/embed" frameborder="0" scrolling="no" allowfullscreen></iframe>

Choose size:

About this item

Available Formats

About this item

Description:	Nobrega, H (Universiteit van Amsterdam) Friday 9th October 2015 - 12:30 to 13:25


Created:	2015-10-16 16:53
Collection:	Mathematical, Foundational and Computational Aspects of the Higher Infinite
Publisher:	Isaac Newton Institute
Copyright:	Nobrega, H
Language:	eng (English)


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.

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.

Available Formats

Format	Quality	Bitrate	Size
MPEG-4 Video	640x360	1.91 Mbits/sec	633.02 MB	View	Download
WebM	640x360	635.62 kbits/sec	205.38 MB	View	Download
iPod Video	480x270	493.61 kbits/sec	159.44 MB	View	Download
MP3	44100 Hz	249.74 kbits/sec	80.76 MB	Listen	Download
Auto *	(Allows browser to choose a format it supports)