{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,22]],"date-time":"2025-03-22T04:19:42Z","timestamp":1742617182280,"version":"3.40.2"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540582014"},{"type":"electronic","value":"9783540485667"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1994]]},"DOI":"10.1007\/3-540-58201-0_62","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T15:32:05Z","timestamp":1330270325000},"page":"118-129","source":"Crossref","is-referenced-by-count":0,"title":["Tailoring recursion for complexity"],"prefix":"10.1007","author":[{"given":"Erich","family":"Gr\u00e4del","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuri","family":"Gurevich","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,29]]},"reference":[{"key":"10_CR1","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1016\/0022-0000(91)90032-Z","volume":"43","author":"S. Abiteboul","year":"1991","unstructured":"S. Abiteboul and V. Vianu, Datalog Extensions for Database Queries and Updates, J. Computer and System Sciences 43 (1991), 62\u2013124.","journal-title":"J. Computer and System Sciences"},{"key":"10_CR2","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1016\/0890-5401(90)90063-N","volume":"87","author":"K. Compton","year":"1990","unstructured":"K. Compton and C. Laflamme, An Algebra and a Logic for NC 1, Information and Computation 87 (1990), 241\u2013263.","journal-title":"Information and Computation"},{"key":"10_CR3","first-page":"43","volume":"7","author":"R. Fagin","year":"1974","unstructured":"R. Fagin, Generalized first-order spectra and polynomial-time recognizable sets, SIAM-AMS Proc. 7 (1974), 43\u201373.","journal-title":"SIAM-AMS Proc."},{"key":"10_CR4","doi-asserted-by":"crossref","unstructured":"A. Goerdt, Characterizing complexity classes by general recursive definitions in higher types, Proceedings of CSL '88, Lecture Notes in Computer Science Nr. 385, Springer (1989), 99\u2013117.","DOI":"10.1007\/BFb0026297"},{"key":"10_CR5","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1016\/0304-3975(92)90149-A","volume":"101","author":"E. Gr\u00e4del","year":"1992","unstructured":"E. Gr\u00e4del, Capturing Complexity Classes by Fragments of Second Order Logic, Theoretical Computer Science 101 (1992), 35\u201357.","journal-title":"Theoretical Computer Science"},{"key":"10_CR6","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1007\/3-540-56992-8_15","volume":"Nr. 702","author":"E. Gr\u00e4del","year":"1993","unstructured":"E. Gr\u00e4del and M. Otto, Inductive Definability with Counting on Finite Structures, Proceedings of CSL92, Lecture Notes in Computer Science Nr. 702 (1993), 231\u2013247.","journal-title":"Lecture Notes in Computer Science"},{"key":"10_CR7","doi-asserted-by":"crossref","unstructured":"Y. Gurevich, Algebras of feasible functions, Proceedings of 24th IEEE Symposium on Foundations of Computer Science 1983, 210\u2013214.","DOI":"10.1109\/SFCS.1983.5"},{"key":"10_CR8","unstructured":"Y. Gurevich, Toward logic tailord for computational complexity, Computation and Proof Theory, Lecture Notes in Mathematics Nr. 1104, Springer (1984), 175\u2013216."},{"key":"10_CR9","unstructured":"Y. Gurevich, Logic and the Challenge of Computer Science, in: E. B\u00f6rger (Ed), Trends in Theoretical Computer Science, Computer Science Press (1988), 1\u201357."},{"key":"10_CR10","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1016\/S0019-9958(84)80062-5","volume":"61","author":"Y. Gurevich","year":"1984","unstructured":"Y. Gurevich and H. Lewis, A Logic for Constant-Depth Circuits, Information and Control 61 (1984), 65\u201374.","journal-title":"Information and Control"},{"key":"10_CR11","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1090\/psapm\/038\/1020810","volume":"38","author":"N. Immerman","year":"1989","unstructured":"N. Immerman, Descriptive and Computational Complexity, Proc. of AMS Symposia in Appl. Math. 38 (1989), 75\u201391.","journal-title":"Proc. of AMS Symposia in Appl. Math."},{"key":"10_CR12","doi-asserted-by":"crossref","first-page":"118","DOI":"10.2307\/2275180","volume":"57","author":"L. Lo","year":"1992","unstructured":"Libo Lo, Functions and Functionals on Finite Systems, Journal of Symbolic Logic 57 (1992), 118\u2013130.","journal-title":"Journal of Symbolic Logic"},{"key":"10_CR13","first-page":"319","volume":"16","author":"V. Sazonov","year":"1980","unstructured":"V. Sazonov, Polynomial computability and recursivity in finite domains, Elektronische Datenverarbeitung und Kybernetik 16 (1980), 319\u2013323.","journal-title":"Elektronische Datenverarbeitung und Kybernetik"},{"key":"10_CR14","doi-asserted-by":"crossref","unstructured":"M. Vardi, Complexity of Relational Query Languages, Proc. of 14th Symposium on Theory of Computing (1982), 137\u2013146.","DOI":"10.1145\/800070.802186"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-58201-0_62.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T22:23:07Z","timestamp":1742595787000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-58201-0_62"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540582014","9783540485667"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/3-540-58201-0_62","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1994]]}}}