{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T01:04:24Z","timestamp":1743037464006,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540534143"},{"type":"electronic","value":"9783540468691"}],"license":[{"start":{"date-parts":[[1990,1,1]],"date-time":"1990-01-01T00:00:00Z","timestamp":631152000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1990]]},"DOI":"10.1007\/3-540-53414-8_37","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T22:02:12Z","timestamp":1330207332000},"page":"148-158","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Characterizing complexity classes by higher type"],"prefix":"10.1007","author":[{"given":"Andreas","family":"Goerdt","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Helmut","family":"Seidl","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,8]]},"reference":[{"key":"11_CR1","unstructured":"Barendregt, H., The lambda calculus. North Holland 1984."},{"key":"11_CR2","doi-asserted-by":"crossref","unstructured":"Goerdt, A., Characterizing complexity classes by higher type primitive recursive definitions, LICS (1989), 364\u2013374.","DOI":"10.1109\/LICS.1989.39191"},{"key":"11_CR3","unstructured":"Goerdt, A., Characterizing complexity classes by finitely typed \u03bb-terms, Workshop Computer Science Logic 1988, LNCS, to appear."},{"key":"11_CR4","doi-asserted-by":"crossref","unstructured":"Gurevich, Y., Algebras of feasible functions, 24th FOCS (1983), 210\u2013214.","DOI":"10.1109\/SFCS.1983.5"},{"key":"11_CR5","first-page":"175","volume":"1104","author":"Y. Gurevich","year":"1984","unstructured":"Gurevich, Y., Toward logic taylored for computational complexity, computation and proof theory, LNM 1104 (1984), 175\u2013216.","journal-title":"LNM"},{"key":"11_CR6","doi-asserted-by":"crossref","unstructured":"Immerman, N., Expressibility as a complexity measure: results and directions, 2nd Conf. Structure in Complexity Theory (1987), 194\u2013202.","DOI":"10.1109\/PSCT.1987.10319271"},{"key":"11_CR7","unstructured":"Kfoury, A., Tiuryn, J.,Urzyczyn, P., The hierarchy of finitely typed functional programs, LICS (1987), 225\u2013235."},{"key":"11_CR8","doi-asserted-by":"crossref","unstructured":"Leivant, D., Characterization of complexity classes in higher order logic, 2nd conf. Structure in Complexity Theory (1987), 203\u2013218.","DOI":"10.1109\/PSCT.1987.10319272"},{"key":"11_CR9","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1016\/0304-3975(77)90044-5","volume":"5","author":"G. Plotkin","year":"1977","unstructured":"Plotkin, G., LCF considered as a programming language, TCS 5 (1977), 223\u2013257.","journal-title":"TCS"},{"key":"11_CR10","unstructured":"Schwichtenberg, H., Elimination of higher type levels in definitions of primitive recursive functions by means of transfinite recursion, Logic Colloquium 1973, North Holland."},{"key":"11_CR11","first-page":"319","volume":"16","author":"V. Sazonov","year":"1980","unstructured":"Sazonov, V., Polynomial computability and recursivity in finite domains, EIK 16 (1980), 319\u2013323.","journal-title":"EIK"},{"key":"11_CR12","doi-asserted-by":"crossref","first-page":"395","DOI":"10.2307\/2273149","volume":"47","author":"T. J","year":"1982","unstructured":"Terlouw, J., On the definition trees of ordinal recursive functionals: reduction of recursion orders by means of type level raising, J. Symbolic Logic 47 (1982), 395\u2013403.","journal-title":"J. Symbolic Logic"},{"key":"11_CR13","first-page":"177","volume":"233","author":"J. Tiuryn","year":"1986","unstructured":"Tiuryn, J., Higher order arrays and stacks in programming: An application of complexity theory to logics of programs, 12th MFCS (1986), LNCS 233, 177\u2013198.","journal-title":"LNCS"},{"key":"11_CR14","doi-asserted-by":"crossref","unstructured":"Tiuryn, J.,Urzyczyn, P., Some connections between logic of programs and complexity theory. 24th FOCS (1983), 180\u2013184.","DOI":"10.1109\/SFCS.1983.71"}],"container-title":["Lecture Notes in Computer Science","Aspects and Prospects of Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-53414-8_37","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T21:07:45Z","timestamp":1742591265000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-53414-8_37"}},"subtitle":["Primitive recursive definitions, part II"],"short-title":[],"issued":{"date-parts":[[1990]]},"ISBN":["9783540534143","9783540468691"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/3-540-53414-8_37","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1990]]},"assertion":[{"value":"8 June 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}