{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T17:04:20Z","timestamp":1725728660856},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642390524"},{"type":"electronic","value":"9783642390531"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-39053-1_34","type":"book-chapter","created":{"date-parts":[[2013,6,3]],"date-time":"2013-06-03T04:28:12Z","timestamp":1370233692000},"page":"294-305","source":"Crossref","is-referenced-by-count":0,"title":["Closed Choice for Finite and for Convex Sets"],"prefix":"10.1007","author":[{"given":"St\u00e9phane","family":"Le Roux","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Arno","family":"Pauly","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"8","key":"34_CR1","doi-asserted-by":"publisher","first-page":"968","DOI":"10.1016\/j.apal.2011.12.020","volume":"163","author":"V. Brattka","year":"2012","unstructured":"Brattka, V., de Brecht, M., Pauly, A.: Closed choice and a uniform low basis theorem. Annals of Pure and Applied Logic\u00a0163(8), 968\u20131008 (2012)","journal-title":"Annals of Pure and Applied Logic"},{"issue":"1","key":"34_CR2","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1093\/logcom\/exn027","volume":"19","author":"V. Brattka","year":"2009","unstructured":"Brattka, V., Gherardi, G.: Borel complexity of topological operations on computable metric spaces. Journal of Logic and Computation\u00a019(1), 45\u201376 (2009)","journal-title":"Journal of Logic and Computation"},{"issue":"1","key":"34_CR3","doi-asserted-by":"publisher","first-page":"73","DOI":"10.2178\/bsl\/1294186663","volume":"17","author":"V. Brattka","year":"2011","unstructured":"Brattka, V., Gherardi, G.: Effective choice and boundedness principles in computable analysis. Bulletin of Symbolic Logic\u00a017(1), 73\u2013117 (2011), arXiv:0905.4685","journal-title":"Bulletin of Symbolic Logic"},{"key":"34_CR4","doi-asserted-by":"publisher","first-page":"143","DOI":"10.2178\/jsl\/1294170993","volume":"76","author":"V. Brattka","year":"2011","unstructured":"Brattka, V., Gherardi, G.: Weihrauch degrees, omniscience principles and weak computability. Journal of Symbolic Logic\u00a076, 143\u2013176 (2011), arXiv:0905.4679","journal-title":"Journal of Symbolic Logic"},{"issue":"6","key":"34_CR5","doi-asserted-by":"publisher","first-page":"623","DOI":"10.1016\/j.apal.2011.10.006","volume":"163","author":"V. Brattka","year":"2012","unstructured":"Brattka, V., Gherardi, G., Marcone, A.: The Bolzano-Weierstrass Theorem is the jump of Weak K\u00f6nig\u2019s Lemma. Annals of Pure and Applied Logic\u00a0163(6), 623\u2013625 (2012), also arXiv:1101.0792","journal-title":"Annals of Pure and Applied Logic"},{"key":"34_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1007\/978-3-642-30870-3_7","volume-title":"How the World Computes","author":"V. Brattka","year":"2012","unstructured":"Brattka, V., Le Roux, S., Pauly, A.: On the computational content of the brouwer fixed point theorem. In: Cooper, S.B., Dawar, A., L\u00f6we, B. (eds.) CiE 2012. LNCS, vol.\u00a07318, pp. 56\u201367. Springer, Heidelberg (2012)"},{"key":"34_CR7","unstructured":"Brattka, V., Pauly, A.: Computation with advice. Electronic Proceedings in Theoretical Computer Science\u00a024 (2010), http:\/\/arxiv.org\/html\/1006.0551 cCA 2010"},{"key":"34_CR8","doi-asserted-by":"crossref","unstructured":"Gasarch, W., Martin, G.: Bounded Queries in Recursion Theory. In: Progress in Computer Science & Applied Logic, vol.\u00a016. Birkh\u00e4user (1999)","DOI":"10.1007\/978-1-4612-0635-4"},{"issue":"4","key":"34_CR9","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1215\/00294527-2009-018","volume":"50","author":"G. Gherardi","year":"2009","unstructured":"Gherardi, G., Marcone, A.: How incomputable is the separable Hahn-Banach theorem? Notre Dame Journal of Formal Logic\u00a050(4), 393\u2013425 (2009)","journal-title":"Notre Dame Journal of Formal Logic"},{"key":"34_CR10","unstructured":"Hertling, P.: Unstetigkeitsgrade von Funktionen in der effektiven Analysis. Ph.D. thesis, Fernuniversit\u00e4t, Gesamthochschule in Hagen (Oktober 1996)"},{"key":"34_CR11","doi-asserted-by":"crossref","unstructured":"Higuchi, K., Pauly, A.: The degree-structure of Weihrauch-reducibility. Logical Methods in Computer Science\u00a09(2) (2013)","DOI":"10.2168\/LMCS-9(2:2)2013"},{"key":"34_CR12","doi-asserted-by":"crossref","first-page":"131","DOI":"10.3233\/COM-12012","volume":"2","author":"T. Kihara","year":"2012","unstructured":"Kihara, T.: Incomputability of simply connected planar continua. Computability\u00a0(2), 131\u2013152 (2012)","journal-title":"Computability"},{"key":"34_CR13","unstructured":"Le\u00a0Roux, S., Pauly, A.: Closed choice: Cardinality vs convex dimension. arXiv (2013)"},{"issue":"5","key":"34_CR14","doi-asserted-by":"publisher","first-page":"545","DOI":"10.1002\/malq.200610058","volume":"54","author":"S. Roux Le","year":"2008","unstructured":"Le Roux, S., Ziegler, M.: Singular coverings and non-uniform notions of closed set computability. Mathematical Logic Quarterly\u00a054(5), 545\u2013560 (2008)","journal-title":"Mathematical Logic Quarterly"},{"key":"34_CR15","first-page":"223","volume":"2","author":"L. Longpr\u00e9","year":"2008","unstructured":"Longpr\u00e9, L., Kreinovich, V., Gasarch, W., Walster, W.: m solutions good, m\u2009\u2212\u20091 solutions better. Applied Mathematical Sciences\u00a02, 223\u2013239 (2008)","journal-title":"Applied Mathematical Sciences"},{"key":"34_CR16","unstructured":"Mylatz, U.: Vergleich unstetiger Funktionen in der Analysis. Master\u2019s thesis, Fachbereich Informatik, FernUniversit\u00e4t Hagen (May 1992)"},{"key":"34_CR17","unstructured":"Mylatz, U.: Vergleich unstetiger Funktionen : \u201cPrinciple of Omniscience\u201d und Vollst\u00e4ndigkeit in der C-Hierarchie. Ph.D. thesis, Fernuniversit\u00e4t, Gesamthochschule in Hagen (May 2006)"},{"issue":"18","key":"34_CR18","first-page":"2686","volume":"16","author":"A. Pauly","year":"2010","unstructured":"Pauly, A.: How incomputable is finding Nash equilibria? Journal of Universal Computer Science\u00a016(18), 2686\u20132710 (2010)","journal-title":"Journal of Universal Computer Science"},{"issue":"5","key":"34_CR19","doi-asserted-by":"publisher","first-page":"488","DOI":"10.1002\/malq.200910104","volume":"56","author":"A. Pauly","year":"2010","unstructured":"Pauly, A.: On the (semi)lattices induced by continuous reducibilities. Mathematical Logic Quarterly\u00a056(5), 488\u2013502 (2010)","journal-title":"Mathematical Logic Quarterly"},{"key":"34_CR20","unstructured":"Pauly, A., de\u00a0Brecht, M.: Non-deterministic computation and the Jayne Rogers theorem. Electronic Proceedings in Theoretical Computer Science, DCM 2012 (2012) (to appear)"},{"key":"34_CR21","unstructured":"Stein, T.v.: Vergleich nicht konstruktiv l\u00f6sbarer Probleme in der Analysis. Master\u2019s thesis, Fachbereich Informatik, FernUniversit\u00e4t Hagen (1989)"},{"key":"34_CR22","unstructured":"Weihrauch, K.: The degrees of discontinuity of some translators between representations of the real numbers. Informatik Berichte 129, FernUniversit\u00e4t Hagen, Hagen (July 1992)"},{"key":"34_CR23","unstructured":"Weihrauch, K.: The TTE-interpretation of three hierarchies of omniscience principles. Informatik Berichte 130, FernUniversit\u00e4t Hagen, Hagen (September 1992)"},{"key":"34_CR24","doi-asserted-by":"crossref","unstructured":"Weihrauch, K.: Computable Analysis. Springer (2000)","DOI":"10.1007\/978-3-642-56999-9"},{"key":"34_CR25","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/s00224-006-1343-6","volume":"41","author":"M. Ziegler","year":"2007","unstructured":"Ziegler, M.: Real hypercomputation and continuity. Theory of Computing Systems\u00a041, 177\u2013206 (2007)","journal-title":"Theory of Computing Systems"}],"container-title":["Lecture Notes in Computer Science","The Nature of Computation. Logic, Algorithms, Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-39053-1_34","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,7,27]],"date-time":"2020-07-27T15:14:30Z","timestamp":1595862870000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-39053-1_34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642390524","9783642390531"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-39053-1_34","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}