{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:51:15Z","timestamp":1725558675536},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540201014"},{"type":"electronic","value":"9783540398134"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-39813-4_21","type":"book-chapter","created":{"date-parts":[[2010,6,29]],"date-time":"2010-06-29T19:27:49Z","timestamp":1277839669000},"page":"290-301","source":"Crossref","is-referenced-by-count":9,"title":["Gandy\u2019s Theorem for Abstract Structures without the Equality Test"],"prefix":"10.1007","author":[{"given":"Margarita","family":"Korovina","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"21_CR1","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":"21_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":"21_CR3","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1016\/S0168-0072(99)00005-6","volume":"100","author":"A. Blass","year":"1999","unstructured":"Blass, A., Gurevich, Y., Shelah, S.: Choiceless polynomial time. Annals of Pure and Applied Logic\u00a0100, 141\u2013187 (1999)","journal-title":"Annals of Pure and Applied Logic"},{"key":"21_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)"},{"issue":"2","key":"21_CR5","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. Theoretical Computer Science\u00a0284(2), 1\u201317 (2002)","journal-title":"Theoretical Computer Science"},{"key":"21_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0890-5401(92)90074-P","volume":"101","author":"E. Dahlhaus","year":"1992","unstructured":"Dahlhaus, E., Makowsky, J.A.: Query languages for hierarchic databases. Information and Computation\u00a0101, 1\u201332 (1992)","journal-title":"Information and Computation"},{"issue":"1","key":"21_CR7","first-page":"65","volume":"8","author":"A. Davar","year":"2002","unstructured":"Davar, A., Gurevich, Y.: Fixed-point logics. BSL\u00a08(1), 65\u201388 (2002)","journal-title":"BSL"},{"key":"21_CR8","volume-title":"Finite Model Theory","author":"H. Ebbinghaus","year":"1999","unstructured":"Ebbinghaus, H., Flum, J.: Finite Model Theory. Springer, Berlin (1999)"},{"key":"21_CR9","doi-asserted-by":"crossref","unstructured":"Edalat, A., Escardo, M.: Integration in Real PCF. In: Proc. of 11th Annual IEEE Symposium on Logic in Computer Science, pp. 382\u2013393 (1996)","DOI":"10.1109\/LICS.1996.561453"},{"key":"21_CR10","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":"21_CR11","volume-title":"Definability and computability","author":"Y.L. Ershov","year":"1996","unstructured":"Ershov, Y.L.: Definability and computability. Plenum, New-York (1996)"},{"key":"21_CR12","first-page":"323","volume":"20","author":"H. Friedman","year":"1992","unstructured":"Friedman, H., Ko, K.: Computational complexity of real functions. Theoretical Computer Science\u00a020, 323\u2013352 (1992)","journal-title":"Theoretical Computer Science"},{"key":"21_CR13","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":"21_CR14","doi-asserted-by":"crossref","first-page":"61","DOI":"10.4064\/fm-44-1-61-71","volume":"44","author":"A. Grzegorczyk","year":"1957","unstructured":"Grzegorczyk, A.: On the definitions of computable real continuous function. Fundamenta Mathematik\u00a044, 61\u201371 (1957)","journal-title":"Fundamenta Mathematik"},{"key":"21_CR15","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. Elsevier, Amsterdam (1999)"},{"key":"21_CR16","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":"21_CR17","doi-asserted-by":"crossref","unstructured":"Kohlenbach, U.: Proof theory and computational analysis. Electronic Notes in Theoretical Computer Science\u00a013 (1998)","DOI":"10.1016\/S1571-0661(05)80219-1"},{"key":"21_CR18","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":"21_CR19","doi-asserted-by":"crossref","unstructured":"Korovina, M.: Fixed points on the reals numbers without the equality test. Electronic Notes in Theoretical Computer Science\u00a066(1) (2002)","DOI":"10.1016\/S1571-0661(04)80382-7"},{"key":"21_CR20","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":"21_CR21","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, vol.\u00a02, pp. 97\u2013115 (1999)","DOI":"10.1515\/9783110807486.97"},{"key":"21_CR22","doi-asserted-by":"publisher","first-page":"427","DOI":"10.2307\/1994926","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":"21_CR23","series-title":"Studies in Logic and the Foundations of Mathematics","volume-title":"Elementary Induction on Abstract Structures","author":"Y.N. Moschovakis","year":"1974","unstructured":"Moschovakis, Y.N.: Elementary Induction on Abstract Structures. Studies in Logic and the Foundations of Mathematics, vol.\u00a077. North-Holland, Amsterdam (1974)"},{"key":"21_CR24","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":"21_CR25","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, vol.\u00a05, pp. 397\u2013525. Oxford University Press, Oxford (2000)"},{"key":"21_CR26","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":"21_CR27","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","Logic for Programming, Artificial Intelligence, and Reasoning"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-39813-4_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T14:59:51Z","timestamp":1559228391000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-39813-4_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540201014","9783540398134"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-39813-4_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}