{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T14:18:16Z","timestamp":1725459496670},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540633570"},{"type":"electronic","value":"9783540695226"}],"license":[{"start":{"date-parts":[[1997,1,1]],"date-time":"1997-01-01T00:00:00Z","timestamp":852076800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/bfb0045083","type":"book-chapter","created":{"date-parts":[[2006,2,6]],"date-time":"2006-02-06T14:16:11Z","timestamp":1139235371000},"page":"166-175","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Computability on continuous, lower semi-continuous and upper semi-continuous real functions"],"prefix":"10.1007","author":[{"given":"Klaus","family":"Weihrauch","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xizhong","family":"Zheng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2006,1,24]]},"reference":[{"key":"18_CR1","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0787-0","volume-title":"Introduction to Analysis","author":"A. Brown","year":"1995","unstructured":"A. Brown & C. Pearcy Introduction to Analysis. Springer-Verlag, Berlin, Heidelberg, 1995."},{"key":"18_CR2","volume-title":"General Topology","author":"R. Engelking","year":"1989","unstructured":"R. Engelking General Topology, Heldermann Verlag, Berlin, 1989."},{"key":"18_CR3","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1016\/0168-0072(95)00034-8","volume":"78","author":"X. Ge","year":"1996","unstructured":"X. Ge & A. Nerode Effective content of the calculus of variations I: semicontinuity and the chattering lemma. Annals of Pure and Applied Logic, 78 (1996), 127\u2013146.","journal-title":"Annals of Pure and Applied Logic"},{"key":"18_CR4","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4684-6802-1","volume-title":"Complexity Theory of Real Functions","author":"Ker-I Ko","year":"1991","unstructured":"Ker-I Ko Complexity Theory of Real Functions, Birkh\u00e4user, Berlin, 1991."},{"key":"18_CR5","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1016\/0304-3975(85)90208-7","volume":"38","author":"C. Kreitz","year":"1985","unstructured":"Ch. Kreitz & K. Weihrauch Theory of representations, Theoret. Comput. Sci. 38 (1985), 35\u201353.","journal-title":"Theoret. Comput. Sci."},{"key":"18_CR6","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1016\/0168-0072(87)90010-8","volume":"36","author":"C. Kreitz","year":"1987","unstructured":"Ch. Kreitz & K. Weihrauch Compactness in constructive analysis, Annals of Pure and Applied Logic 36 (1987), 29\u201338.","journal-title":"Annals of Pure and Applied Logic"},{"key":"18_CR7","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-21717-7","volume-title":"Computability in Analysis and Physics","author":"M. Pour-El","year":"1989","unstructured":"M. Pour-El & J. Richards Computability in Analysis and Physics. Springer-Verlag, Berlin, Heidelberg, 1989."},{"key":"18_CR8","first-page":"1","volume":"16","author":"A. Reiser","year":"1980","unstructured":"A. Reiser & K. Weihrauch Natural numberings and generalized computability, Elektronische Informationsverarbeitung und Kybernetik 16 (1980)1\u20133, 11\u201320.","journal-title":"Elektronische Informationsverarbeitung und Kybernetik"},{"key":"18_CR9","volume-title":"Theory of Recursive Functions and Effective Computability","author":"H. Rogers Jr.","year":"1967","unstructured":"H. Jr. Rogers Theory of Recursive Functions and Effective Computability McGraw-Hill, Inc. New York, 1967."},{"key":"18_CR10","unstructured":"J. Ian Richards & Q. Zhou Computability of closed and open sets in Euclidean space, Preprint, 1992."},{"key":"18_CR11","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1215\/S0012-7094-52-01928-5","volume":"19","author":"H. Tong","year":"1952","unstructured":"H. TongSome characterizations of normal and perfectly normal space, Duke Math. J. 19 (1952), 289\u2013292.","journal-title":"Duke Math. J."},{"key":"18_CR12","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1016\/0304-3975(85)90207-5","volume":"38","author":"K. Weihrauch","year":"1985","unstructured":"K. Weihrauch Type-2 recursion theory. Theoret. Comput. Sci. 38 (1985), 17\u201333.","journal-title":"Theoret. Comput. Sci."},{"key":"18_CR13","series-title":"EATCS Monographs on Theoretical Computer Secience Vol. 9","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-69965-8","volume-title":"Computability","author":"K. Weihrauch","year":"1987","unstructured":"K. Weihrauch Computability. EATCS Monographs on Theoretical Computer Secience Vol. 9, Springer-Verlag, Berlin, Heidelberg, 1987."},{"key":"18_CR14","unstructured":"K. Weihrauch Effektive Analysis. Lecture Notes for Corresponding Course, Fern-Universit\u00e4t Hagen, 1994."},{"key":"18_CR15","first-page":"66","volume-title":"Combinatorics, Complexity, Logic, Proceedings of DMTCS'96","author":"K. Weihrauch","year":"1996","unstructured":"K. Weihrauch A foundation for computable analysis. in Douglas S. Bridges, Cristian S. Calude, Jeremy Gibbons, Steves Reeves and Ian H. Witten (eds.), Combinatorics, Complexity, Logic, Proceedings of DMTCS'96, pp 66\u201389, Springer-Verlag, Sigapore, 1996."},{"key":"18_CR16","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1016\/0168-0072(87)90065-0","volume":"35","author":"K. Weihrauch","year":"1987","unstructured":"K. Weihrauch & Ch. Kreitz Representations of the real numbers and of the open subsets of the real numbers, Annals of Pure and Applied Logic 35 (1987), 247\u2013260.","journal-title":"Annals of Pure and Applied Logic"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0045083","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,8]],"date-time":"2020-01-08T20:53:35Z","timestamp":1578516815000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0045083"}},"subtitle":["Extended Abstract"],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540633570","9783540695226"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/bfb0045083","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]},"assertion":[{"value":"24 January 2006","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}