{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T09:58:47Z","timestamp":1743069527284,"version":"3.40.3"},"publisher-location":"Cham","reference-count":3,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319042794"},{"type":"electronic","value":"9783319042800"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-04280-0_3","type":"book-chapter","created":{"date-parts":[[2014,1,21]],"date-time":"2014-01-21T10:36:23Z","timestamp":1390300583000},"page":"15-18","source":"Crossref","is-referenced-by-count":0,"title":["Continuous If-Then Statements Are Computable"],"prefix":"10.1007","author":[{"given":"Martine","family":"Ceberio","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vladik","family":"Kreinovich","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"3_CR1","unstructured":"Brattka, V., Gherardi, G.: Weihrauch degrees, omniscience principle, and weak computability. In: Bauer, A., Dillhage, R., Hertling, P., Ko, K.-I., Rettinger, R. (eds.) Proceedings of the Sixth International Conference on Computability and Complexity in Analysis CCA 2009, Ljubljana, Slovenia, August 18-22, pp. 81\u201392 (2009)"},{"key":"3_CR2","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-2793-7","volume-title":"Computational Complexity and Feasibility of Data Processing and Interval Computations","author":"V. Kreinovich","year":"1998","unstructured":"Kreinovich, V., Lakeyev, A., Rohn, J., Kahl, P.: Computational Complexity and Feasibility of Data Processing and Interval Computations. Kluwer, Dordrecht (1998)"},{"key":"3_CR3","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-56999-9","volume-title":"Computable Analysis: An Introduction","author":"K. Weihrauch","year":"2000","unstructured":"Weihrauch, K.: Computable Analysis: An Introduction. Springer, New York (2000)"}],"container-title":["Studies in Computational Intelligence","Constraint Programming and Decision Making"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-04280-0_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,30]],"date-time":"2023-01-30T22:47:44Z","timestamp":1675118864000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-04280-0_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319042794","9783319042800"],"references-count":3,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-04280-0_3","relation":{},"ISSN":["1860-949X","1860-9503"],"issn-type":[{"type":"print","value":"1860-949X"},{"type":"electronic","value":"1860-9503"}],"subject":[],"published":{"date-parts":[[2014]]}}}