{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T22:25:47Z","timestamp":1725575147385},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540261797"},{"type":"electronic","value":"9783540322665"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11494645_30","type":"book-chapter","created":{"date-parts":[[2011,1,16]],"date-time":"2011-01-16T17:37:10Z","timestamp":1295199430000},"page":"235-241","source":"Crossref","is-referenced-by-count":12,"title":["Towards Computability of Higher Type Continuous Data"],"prefix":"10.1007","author":[{"given":"Margarita","family":"Korovina","sequence":"first","affiliation":[]},{"given":"Oleg","family":"Kudinov","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"30_CR1","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1016\/0168-0072(89)90036-5","volume":"45","author":"M. Ajtai","year":"1989","unstructured":"Ajtai, M.: First-order definability on finite structures. Annals of Pure and Applied Logic\u00a045, 211\u2013225 (1989)","journal-title":"Annals of Pure and Applied Logic"},{"key":"30_CR2","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-11035-5","volume-title":"Admissible sets and Structures","author":"J. Barwise","year":"1975","unstructured":"Barwise, J.: Admissible sets and Structures. Springer, Berlin (1975)"},{"key":"30_CR3","volume-title":"Complexity and Real Computation","author":"L. Blum","year":"1996","unstructured":"Blum, L., Cucker, F., Shub, M., Smale, S.: Complexity and Real Computation. Springer, Berlin (1996)"},{"key":"30_CR4","volume-title":"Definability and computability","author":"Y.L. Ershov","year":"1996","unstructured":"Ershov, Y.L.: Definability and computability. Plenum, New-York (1996)"},{"key":"30_CR5","first-page":"323","volume":"20","author":"H. Friedman","year":"1992","unstructured":"Friedman, H., Ko, K.: Computational complexity of\u00a0real functions. Theoretical Computer Science\u00a020, 323\u2013352 (1992)","journal-title":"Theoretical Computer Science"},{"key":"30_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1007\/10703163_14","volume-title":"Computer Science Logic","author":"M. Korovina","year":"1999","unstructured":"Korovina, M., Kudinov, O.: Characteristic properties of majorant-computability over the\u00a0reals. In: Gottlob, G., Grandjean, E., Seyr, K. (eds.) CSL 1998. LNCS, vol.\u00a01584, pp. 188\u2013204. Springer, Heidelberg (1999)"},{"key":"30_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1007\/3-540-45335-0_10","volume-title":"Computability and Complexity in Analysis","author":"M. Korovina","year":"2001","unstructured":"Korovina, M., Kudinov, O.: Formalisation of Computability of Operators and Real-Valued Functionals via Domain Theory. In: Blank, J., Brattka, V., Hertling, P. (eds.) CCA 2000. LNCS, vol.\u00a02064, pp. 146\u2013168. Springer, Heidelberg (2001)"},{"key":"30_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1007\/3-540-44802-0_12","volume-title":"Computer Science Logic","author":"M. Korovina","year":"2001","unstructured":"Korovina, M., Kudinov, O.: Semantic Characterisations of Second-Order Computability over the\u00a0Real Numbers. In: Fribourg, L. (ed.) CSL 2001 and EACSL 2001. LNCS, vol.\u00a02142, pp. 160\u2013173. Springer, Heidelberg (2001)"},{"key":"30_CR9","series-title":"LNAI","doi-asserted-by":"publisher","first-page":"290","DOI":"10.1007\/978-3-540-39813-4_21","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"M.V. Korovina","year":"2003","unstructured":"Korovina, M.V.: Gandy\u2019s Theorem on Abstract Structures without the\u00a0Equality Test. In: Y. Vardi, M., Voronkov, A. (eds.) LPAR 2003. LNCS (LNAI), vol.\u00a02850, pp. 290\u2013301. Springer, Heidelberg (2003)"},{"key":"30_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"330","DOI":"10.1007\/978-3-540-45220-1_27","volume-title":"Computer Science Logic","author":"M. Korovina","year":"2003","unstructured":"Korovina, M.: Computational aspects of \u03a3-definability over the real numbers without the equality test. In: Baaz, M., Makowsky, J.A. (eds.) CSL 2003. LNCS, vol.\u00a02803, pp. 330\u2013344. Springer, Heidelberg (2003)"},{"key":"30_CR11","unstructured":"Korovina, M., Kudinov, O.: Towards Computability of Higher Type Continuous Data. the full version, \n                  \n                    http:\/\/www.brics.dk\/~korovina\/highertypes.pdf"},{"key":"30_CR12","first-page":"427","volume":"138","author":"Y.N. Moschovakis","year":"1969","unstructured":"Moschovakis, Y.N.: Abstract first order computability I, II. Transactions of the American Mathematical Society\u00a0138, 427\u2013504 (1969)","journal-title":"Transactions of the American Mathematical Society"},{"key":"30_CR13","volume-title":"Computability in Analysis and Physics","author":"M.B. Pour-El","year":"1988","unstructured":"Pour-El, M.B., Richards, J.I.: Computability in Analysis and Physics. Springer, Berlin (1988)"},{"key":"30_CR14","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1142\/S0129054191000170","volume":"2","author":"J.V. Tucker","year":"1991","unstructured":"Tucker, J.V., Zucker, J.I.: Projections of semicomputable relations on astract data types. International Journal of the Foundations of Computer Science\u00a02, 267\u2013296 (1991)","journal-title":"International Journal of the Foundations of Computer Science"},{"key":"30_CR15","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-56999-9","volume-title":"Computable Analysis","author":"K. Weihrauch","year":"2000","unstructured":"Weihrauch, K.: Computable Analysis. Springer, Berlin (2000)"}],"container-title":["Lecture Notes in Computer Science","New Computational Paradigms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11494645_30.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T06:38:12Z","timestamp":1619505492000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11494645_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540261797","9783540322665"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/11494645_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}