{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,10]],"date-time":"2026-03-10T12:59:52Z","timestamp":1773147592116,"version":"3.50.1"},"reference-count":52,"publisher":"Cambridge University Press (CUP)","issue":"1","license":[{"start":{"date-parts":[[2014,1,15]],"date-time":"2014-01-15T00:00:00Z","timestamp":1389744000000},"content-version":"unspecified","delay-in-days":1051,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Bull. symb. log"],"published-print":{"date-parts":[[2011,3]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>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 such as co-finite choice, discrete choice, interval choice, compact choice and closed choice, 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, the Closed Graph Theorem and the Uniform Boundedness Theorem. We also explore how existing classifications of the Hahn\u2013Banach Theorem and Weak K\u0151nig's Lemma fit into this picture. Well-known omniscience principles from constructive mathematics such as LPO and LLPO can also naturally be considered as Weihrauch degrees and they play an important role in our classification. Based on this 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. Our classification scheme does not require any particular logical framework or axiomatic setting, but it can be carried out in the framework of classical mathematics using tools of topology, computability theory and computable analysis. 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.<\/jats:p>","DOI":"10.2178\/bsl\/1294186663","type":"journal-article","created":{"date-parts":[[2011,1,4]],"date-time":"2011-01-04T19:17:59Z","timestamp":1294168679000},"page":"73-117","source":"Crossref","is-referenced-by-count":61,"title":["Effective Choice and Boundedness Principles in Computable Analysis"],"prefix":"10.1017","volume":"17","author":[{"given":"Vasco","family":"Brattka","sequence":"first","affiliation":[]},{"given":"Guido","family":"Gherardi","sequence":"additional","affiliation":[]}],"member":"56","published-online":{"date-parts":[[2014,1,15]]},"reference":[{"key":"S1079898600000639_ref018","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0090741"},{"key":"S1079898600000639_ref008","doi-asserted-by":"publisher","DOI":"10.1137\/060658023"},{"key":"S1079898600000639_ref015","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511565663"},{"key":"S1079898600000639_ref044","doi-asserted-by":"publisher","DOI":"10.1002\/malq.200610012"},{"key":"S1079898600000639_ref051","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-56999-9"},{"key":"S1079898600000639_ref047","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-59971-2"},{"key":"S1079898600000639_ref020","doi-asserted-by":"publisher","DOI":"10.1215\/00294527-2009-018"},{"key":"S1079898600000639_ref038","doi-asserted-by":"publisher","DOI":"10.1002\/malq.200910104"},{"key":"S1079898600000639_ref046","doi-asserted-by":"publisher","DOI":"10.1016\/S0168-0072(01)00121-X"},{"key":"S1079898600000639_ref027","first-page":"368","volume-title":"Computation and logic in the real world, third conference on Computability in Europe, CiE 2007","volume":"4497","author":"Ishihara","year":"2007"},{"key":"S1079898600000639_ref009","doi-asserted-by":"publisher","DOI":"10.1016\/j.apal.2008.09.002"},{"key":"S1079898600000639_ref024","doi-asserted-by":"publisher","DOI":"10.1002\/malq.19900360307"},{"key":"S1079898600000639_ref031","doi-asserted-by":"publisher","DOI":"10.1016\/S0168-0072(01)00077-X"},{"key":"S1079898600000639_ref048","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-6027-1"},{"key":"S1079898600000639_ref052","first-page":"357","volume-title":"4th International workshop on Computability and Complexity in Analysis, CCA 2000","volume":"2064","author":"Weihrauch","year":"2001"},{"key":"S1079898600000639_ref041","doi-asserted-by":"publisher","DOI":"10.1002\/1521-3870(200201)48:1<111::AID-MALQ111>3.0.CO;2-6"},{"key":"S1079898600000639_ref013","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(02)00693-X"},{"key":"S1079898600000639_ref003","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44683-4_20"},{"key":"S1079898600000639_ref026","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780198566519.003.0016"},{"key":"S1079898600000639_ref004","doi-asserted-by":"publisher","DOI":"10.4995\/agt.2003.2014"},{"key":"S1079898600000639_ref036","first-page":"567","article-title":"A limiting first order realizability interpretation","volume":"55","author":"Nakata","year":"2002","journal-title":"Scientiae Mathematicae Japonicae"},{"key":"S1079898600000639_ref025","volume-title":"Informal constructive reverse mathematics","author":"Ishihara","year":"2004"},{"key":"S1079898600000639_ref011","first-page":"95","volume-title":"Proceedings of the sixth international conference on Computability and Complexity in Analysis, CCA 2009","author":"Brattka","year":"2009"},{"key":"S1079898600000639_ref007","doi-asserted-by":"publisher","DOI":"10.1007\/s00153-007-0057-z"},{"key":"S1079898600000639_ref014","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(98)00284-9"},{"key":"S1079898600000639_ref043","doi-asserted-by":"publisher","DOI":"10.1002\/malq.200310122"},{"key":"S1079898600000639_ref033","first-page":"1106","article-title":"Ensembles r\u00e9cursivement mesurables et ensembles r\u00e9cursivement ouverts et ferm\u00e9s","volume":"245","author":"Kreisel","year":"1957","journal-title":"Comptes Rendus Math\u00e9matique. Acad\u00e9mie des Sciences. Paris"},{"key":"S1079898600000639_ref042","volume-title":"Theory of recursive functions and effective computability","author":"Rogers","year":"1967"},{"key":"S1079898600000639_ref010","doi-asserted-by":"publisher","DOI":"10.1093\/logcom\/exn027"},{"key":"S1079898600000639_ref017","doi-asserted-by":"publisher","DOI":"10.1090\/conm\/257\/04026"},{"key":"S1079898600000639_ref023","unstructured":"Hertling Peter , Unstetigkeitsgrade von Funktionen in der effektiven Analysis, Dissertation, Fern Universit\u00e4t Hagen, Hagen, November 1996."},{"key":"S1079898600000639_ref034","doi-asserted-by":"publisher","DOI":"10.1002\/malq.19880340202"},{"key":"S1079898600000639_ref016","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1002\/malq.19750210102","article-title":"On a simple definition of computable functions of a real variable\u2014with applications to functions of a complex variable","volume":"21","author":"Caldwell","year":"1975","journal-title":"Zeitschrift f\u00fcr Mathematische Logik und Grundlagen der Mathematik"},{"key":"S1079898600000639_ref039","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-21717-7"},{"key":"S1079898600000639_ref050","volume-title":"Informatik Berichte 130","author":"Weihrauch","year":"1992"},{"key":"S1079898600000639_ref030","doi-asserted-by":"publisher","DOI":"10.1007\/978-94-017-2109-7_7"},{"key":"S1079898600000639_ref045","doi-asserted-by":"publisher","DOI":"10.1002\/malq.200710001"},{"key":"S1079898600000639_ref012","doi-asserted-by":"publisher","DOI":"10.2178\/jsl\/1294170993"},{"key":"S1079898600000639_ref022","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2005.10.019"},{"key":"S1079898600000639_ref040","doi-asserted-by":"publisher","DOI":"10.1016\/0024-3795(90)90379-Q"},{"key":"S1079898600000639_ref021","doi-asserted-by":"publisher","DOI":"10.1002\/malq.19760220136"},{"key":"S1079898600000639_ref002","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(98)00095-4"},{"key":"S1079898600000639_ref032","first-page":"281","volume-title":"Reverse mathematics 2001","volume":"21","author":"Kohlenbach","year":"2005"},{"key":"S1079898600000639_ref029","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9947-1943-0007371-8"},{"key":"S1079898600000639_ref019","doi-asserted-by":"publisher","DOI":"10.1002\/malq.200610021"},{"key":"S1079898600000639_ref049","unstructured":"Weihrauch Klaus , The degrees of discontinuity of some translators between representations of the real numbers, Technical report TR-92-050, International Computer Science Institute, Berkeley, July 1992."},{"key":"S1079898600000639_ref037","volume-title":"Classical recursion theory","volume":"125","author":"Odifreddi","year":"1989"},{"key":"S1079898600000639_ref035","unstructured":"Mylatz Uwe , Vergleich unstetiger Funktionen: \u201cPrinciple of Omniscience\u201d und Vollst\u00e4ndigkeit in der C\u2013hierarchie, Ph.D. thesis, Faculty for Mathematics and Computer Science, University Hagen, Germany, 2006."},{"key":"S1079898600000639_ref005","doi-asserted-by":"publisher","DOI":"10.1002\/malq.200310125"},{"key":"S1079898600000639_ref028","doi-asserted-by":"publisher","DOI":"10.2140\/pjm.1972.40.605"},{"key":"S1079898600000639_ref001","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-61667-9"},{"key":"S1079898600000639_ref006","first-page":"130","volume-title":"Logic colloquium 2002","volume":"27","author":"Brattka","year":"2006"}],"container-title":["The Bulletin of Symbolic Logic"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S1079898600000639","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,27]],"date-time":"2019-04-27T15:20:52Z","timestamp":1556378452000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S1079898600000639\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,3]]},"references-count":52,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2011,3]]}},"alternative-id":["S1079898600000639"],"URL":"https:\/\/doi.org\/10.2178\/bsl\/1294186663","relation":{},"ISSN":["1079-8986","1943-5894"],"issn-type":[{"value":"1079-8986","type":"print"},{"value":"1943-5894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,3]]}}}