Computability in Europe 2006
Logical Approaches to Computational Barriers

Print current page  Print this page

Regular Talk:
The logical strength of the uniform continuity theorem

Speaker: Josef Berger
Slot: Sat, 14:30-14:50, Faraday C (col. 2)

Abstract

We introduce a notion of complexity for sets of finite 
binary sequences such that the corresponding fan theorem
is constructively equivalent to the uniform continuity theorem. 
This settles an open question. 


websites: Arnold Beckmann 2006-04-19 Valid HTML 4.01! Valid CSS! eXTReMe Tracker hit counters by www.free-counters.net