{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T20:28:45Z","timestamp":1725568125156},"publisher-location":"Berlin, Heidelberg","reference-count":37,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540208136"},{"type":"electronic","value":"9783540398660"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-39866-0_25","type":"book-chapter","created":{"date-parts":[[2010,10,25]],"date-time":"2010-10-25T12:30:09Z","timestamp":1288009809000},"page":"238-247","source":"Crossref","is-referenced-by-count":2,"title":["Recent Advances in \u03a3-Definability over Continuous Data Types"],"prefix":"10.1007","author":[{"given":"Margarita","family":"Korovina","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"25_CR1","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-11035-5","volume-title":"Admissible sets and structure","author":"J. Barwise","year":"1975","unstructured":"Barwise, J.: Admissible sets and structure. Springer, Berlin (1975)"},{"key":"25_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-44622-2_1","volume-title":"Computer Science Logic","author":"A. Blass","year":"2000","unstructured":"Blass, A., Gurevich, Y.: Background, reserve and gandy machines. In: Clote, P.G., Schwichtenberg, H. (eds.) CSL 2000. LNCS, vol.\u00a01862, pp. 1\u201317. Springer, Heidelberg (2000)"},{"key":"25_CR3","doi-asserted-by":"crossref","unstructured":"Blass, A., Gurevich, Y., Shelah, S.: Choiceless polynomial time. APAL, 141\u2013187 (1999)","DOI":"10.1016\/S0168-0072(99)00005-6"},{"key":"25_CR4","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":"25_CR5","volume-title":"Real Algebraic Geometry","author":"J. Bochnak","year":"1999","unstructured":"Bochnak, J., Coste, M., Roy, M.-F.: Real Algebraic Geometry. Springer, Berlin (1999)"},{"issue":"2","key":"25_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0304-3975(01)00066-4","volume":"284","author":"V. Brattka","year":"2002","unstructured":"Brattka, V., Hertling, P.: Topological properties of real number representations. TCS\u00a0284(2), 1\u201317 (2002)","journal-title":"TCS"},{"key":"25_CR7","doi-asserted-by":"crossref","unstructured":"Dahlhaus, E., Makowsky, J.A.: Query languages for hierarchic databases. Information and Computation, 1\u201332 (1992)","DOI":"10.1016\/0890-5401(92)90074-P"},{"key":"25_CR8","doi-asserted-by":"crossref","unstructured":"Davar, A., Gurevich, Y.: Fixed-point logics. BSL, 65\u201388 (2002)","DOI":"10.2178\/bsl\/1182353853"},{"key":"25_CR9","volume-title":"Finite Model Theory","author":"H. Ebbinghaus","year":"1999","unstructured":"Ebbinghaus, H., Flum, J.: Finite Model Theory. Springer, Berlin (1999)"},{"key":"25_CR10","doi-asserted-by":"crossref","unstructured":"Edalat, A., Escardo, M.: Integration in real pcf. In: Proc. IEEE Conference on Logic in Computer Science (LICS), pp. 382\u2013393 (1996)","DOI":"10.1109\/LICS.1996.561453"},{"key":"25_CR11","doi-asserted-by":"crossref","unstructured":"Edalat, A., Lieutie, A.: Domain theory and differential calculus (function of one variable. In: Proc. IEEE Conference on Logic in Computer Science (LICS), pp. 277\u2013298 (2002)","DOI":"10.1109\/LICS.2002.1029836"},{"key":"25_CR12","unstructured":"Engeler, E.: Formal Languages: Automata and Structures. Markham Publishing Co (1968)"},{"key":"25_CR13","volume-title":"Definability and computability","author":"Y.L. Ershov","year":"1996","unstructured":"Ershov, Y.L.: Definability and computability. Plenum, New-York (1996)"},{"key":"25_CR14","unstructured":"Freedman, H., Ko, K.: Computational complexity of real functions. TCS, 323\u2013352 (1992)"},{"key":"25_CR15","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1016\/S0049-237X(08)71238-2","volume-title":"Logic colloquium 1969","author":"H. Friedman","year":"1971","unstructured":"Friedman, H.: Algorithmic procedures, generalized Turing algorithms, and elementary recursion theory. In: Yates, C.M.E., Gandy, R.O. (eds.) Logic colloquium 1969, pp. 361\u2013390. C.M.E, Hollang, Amsterdam (1971)"},{"key":"25_CR16","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1016\/S0049-237X(08)70591-3","volume-title":"Generalized Recursion Theory","author":"R. Gandy","year":"1974","unstructured":"Gandy, R.: Inductive definitions. In: Fenstad, J.E., Hinman, P.D. (eds.) Generalized Recursion Theory, pp. 265\u2013300. North-Holland, Amsterdam (1974)"},{"key":"25_CR17","doi-asserted-by":"crossref","unstructured":"Grzegorczyk, A.: On the definitions of computable real continuous function. Fundamenta Mathematik, 61\u201371 (1957)","DOI":"10.4064\/fm-44-1-61-71"},{"key":"25_CR18","volume-title":"Dynamic Logic","author":"D. Harel","year":"2002","unstructured":"Harel, D., Kozen, D., Tiuryn, J.: Dynamic Logic. The MIT press, Cambridge (2002)"},{"key":"25_CR19","first-page":"317","volume-title":"Handbook of Computability Theory","author":"P.G. Hinman","year":"1999","unstructured":"Hinman, P.G.: Recursion on abstract structure. In: Griffor, E.R. (ed.) Handbook of Computability Theory, pp. 317\u2013359. Elsevie, Amsterdam (1999)"},{"key":"25_CR20","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0539-5","volume-title":"Descriptive Complexity","author":"N. Immerman","year":"1999","unstructured":"Immerman, N.: Descriptive Complexity. Springer, New-York (1999)"},{"key":"25_CR21","doi-asserted-by":"crossref","unstructured":"Kohlenbach, U.: Proof theory and computational analysis. Electronic Notes in Theoretical Computer Science (1998)","DOI":"10.1016\/S1571-0661(05)80219-1"},{"key":"25_CR22","unstructured":"Korovina, M.: Computability and \u03a3-definability over the reals. Technical report, BRICS (2003), http:\/\/www.brics.dk\/~korovina\/compreals.ps"},{"key":"25_CR23","unstructured":"Korovina, M.: Computational aspects of \u03a3-definability over the real numbers without the equality test (to appear), http:\/\/www.brics.dk\/~korovina\/definability.ps"},{"key":"25_CR24","doi-asserted-by":"crossref","unstructured":"Korovina, M.: Fixed points on the abstract structures without the equality test. Technical report, BRICS (2002), http:\/\/www.brics.dk\/RS\/02\/26\/index.html","DOI":"10.7146\/brics.v9i26.21742"},{"key":"25_CR25","doi-asserted-by":"crossref","unstructured":"Korovina, M.: Fixed points on the reals numbers without the equality test. Electronic Notes in TCS\u00a066(1) (2002)","DOI":"10.1016\/S1571-0661(04)80382-7"},{"key":"25_CR26","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 reals. In: Gottlob, G., Grandjean, E., Seyr, K. (eds.) CSL 1998. LNCS, vol.\u00a01584, pp. 188\u2013204. Springer, Heidelberg (1999)"},{"key":"25_CR27","doi-asserted-by":"crossref","unstructured":"Korovina, M., Kudinov, O.: Some properties of majorant-computability. In: Arslanov, M., Lempp, S. (eds.) Recursion Theory and Complexity, Proceedings of the Kazan 1997 Workshop, Berlin - New York, July 14-19. de Gruyter Series in Logic and its Applications, pp. 97\u2013115 (1999)","DOI":"10.1515\/9783110807486.97"},{"key":"25_CR28","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0049-237X(08)71223-0","volume-title":"Proc. of Logic Colloquium 1969","author":"D. Locombe","year":"1971","unstructured":"Locombe, D.: Recursion theoretical structure for relational systems. In: Gandy, R.O., Yates, C.M.E. (eds.) Proc. of Logic Colloquium 1969, pp. 3\u201317. North-Holland, Amsterdam (1971)"},{"issue":"1-2","key":"25_CR29","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/S0304-3975(98)00190-X","volume":"242","author":"K. Meer","year":"2000","unstructured":"Meer, K.: Counting problems over the reals. TCS\u00a0242(1-2), 41\u201358 (2000)","journal-title":"TCS"},{"key":"25_CR30","doi-asserted-by":"crossref","unstructured":"Moschovakis, Y.N.: Abstract first order computability. i, ii. Transactions of the American Mathematical Society, 427\u2013446 (1969)","DOI":"10.2307\/1994926"},{"key":"25_CR31","series-title":"Studies in Logic and the Foundations of Mathematics","volume-title":"Elementary Induction on Abstract Structur","author":"Y.N. Moschovakis","year":"1974","unstructured":"Moschovakis, Y.N.: Elementary Induction on Abstract Structur. Studies in Logic and the Foundations of Mathematics, vol.\u00a077. North-Holland Publishing Co., American Elsevier Publishing Co, Amsterdam-London (1974)"},{"key":"25_CR32","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":"25_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"378","DOI":"10.1007\/3-540-45575-2_38","volume-title":"Perspectives of System Informatics","author":"V. Sazonov","year":"2001","unstructured":"Sazonov, V.: Using agents for concurrent querying of web-like databases via hyperset- theoretic approach. In: Bj\u00f8rner, D., Broy, M., Zamulin, A.V. (eds.) PSI 2001. LNCS, vol.\u00a02244, pp. 378\u2013394. Springer, Heidelberg (2001)"},{"key":"25_CR34","doi-asserted-by":"crossref","unstructured":"Takeuti, G., Kino, A.: On predicates with constructive infinitary long expressions. J. Math. Soc. Japan, 176\u2013190 (1963)","DOI":"10.2969\/jmsj\/01520176"},{"key":"25_CR35","first-page":"397","volume-title":"Handbook of Logic in Computer Science","author":"J.V. Tucker","year":"2000","unstructured":"Tucker, J.V., Zucker, J.I.: Computable functions and semicomputable sets on many-sorted algebras. In: Maibaum, T.S.E., Abramsky, S., Gabbay, D.M. (eds.) Handbook of Logic in Computer Science, pp. 397\u2013525. Oxford University Press, Oxford (2000)"},{"key":"25_CR36","doi-asserted-by":"crossref","unstructured":"Vardi, M.: The complexity of relational query languages. In: Proc. of the 14th ACM Symposium on the Theory of Computing, pp. 37\u2013146 (1982)","DOI":"10.1145\/800070.802186"},{"key":"25_CR37","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","Perspectives of System Informatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-39866-0_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,5]],"date-time":"2019-06-05T17:22:48Z","timestamp":1559755368000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-39866-0_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540208136","9783540398660"],"references-count":37,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-39866-0_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}