The Logical Strength of the Uniform Continuity Theorem

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.

Gespeichert in:

Bibliographische Detailangaben
1. Verfasser:	Berger, Josef
Format:	Tagungsbericht
Sprache:	eng
Schlagworte:	Algorithmics. Computability. Computer arithmetics Applied sciences Computer science control theory systems Constructive reverse mathematics Exact sciences and technology Theoretical computing uniform continuity theorem
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Beschreibung
Zusammenfassung:	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.
ISSN:	0302-9743 1611-3349
DOI:	10.1007/11780342_4