Mathematics – Logic
Scientific paper
2009-05-28
Bulletin of Symbolic Logic 17:1 (2011) 73-117
Mathematics
Logic
Scientific paper
10.2178/bsl/1294186663
In this paper we study a new approach to classify mathematical theorems according to their computational content. Basically, we are asking the question which theorems can be continuously or computably transferred into each other? For this purpose theorems are considered via their realizers which are operations with certain input and output data. The technical tool to express continuous or computable relations between such operations is Weihrauch reducibility and the partially ordered degree structure induced by it. We have identified certain choice principles which are cornerstones among Weihrauch degrees and it turns out that certain core theorems in analysis can be classified naturally in this structure. In particular, we study theorems such as the Intermediate Value Theorem, the Baire Category Theorem, the Banach Inverse Mapping Theorem and others. We also explore how existing classifications of the Hahn-Banach Theorem and Weak K"onig's Lemma fit into this picture. We compare the results of our classification with existing classifications in constructive and reverse mathematics and we claim that in a certain sense our classification is finer and sheds some new light on the computational content of the respective theorems. We develop a number of separation techniques based on a new parallelization principle, on certain invariance properties of Weihrauch reducibility, on the Low Basis Theorem of Jockusch and Soare and based on the Baire Category Theorem. Finally, we present a number of metatheorems that allow to derive upper bounds for the classification of the Weihrauch degree of many theorems and we discuss the Brouwer Fixed Point Theorem as an example.
Brattka Vasco
Gherardi Guido
No associations
LandOfFree
Effective Choice and Boundedness Principles in Computable Analysis does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Effective Choice and Boundedness Principles in Computable Analysis, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Effective Choice and Boundedness Principles in Computable Analysis will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-294484