{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T12:15:03Z","timestamp":1742991303665,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540354666"},{"type":"electronic","value":"9783540354680"}],"license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11780342_30","type":"book-chapter","created":{"date-parts":[[2006,6,28]],"date-time":"2006-06-28T02:19:46Z","timestamp":1151461186000},"page":"279-288","source":"Crossref","is-referenced-by-count":4,"title":["Complexity-Theoretic Hierarchies"],"prefix":"10.1007","author":[{"given":"Lars","family":"Kristiansen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"30_CR1","volume-title":"Handbook of Proof Theory","author":"J. Avigad","year":"1998","unstructured":"Avigad, J., Feferman, S.: G\u00f6del\u2019s functional interpretation. In: Buss, S. (ed.) Handbook of Proof Theory. Elsevier, Amsterdam (1998)"},{"key":"30_CR2","first-page":"30","volume":"88","author":"A. Bel\u2019tyukov","year":"1982","unstructured":"Bel\u2019tyukov, A.: A machine description and the hierarchy of initial Grzegorczyk classes. J. Soviet Math (1982), Zap. Naucn. Sem. Leninigrad. Otdel. May. Inst. Steklov (LOMI)\u00a088, 30\u201346 (1982)","journal-title":"J. Soviet Math (1982), Zap. Naucn. Sem. Leninigrad. Otdel. May. Inst. Steklov (LOMI)"},{"key":"30_CR3","volume-title":"Handbook of Computability Theory","author":"P. Clote","year":"1996","unstructured":"Clote, P.: Computation models and function algebra. In: Griffor, E. (ed.) Handbook of Computability Theory. Elsevier, Amsterdam (1996)"},{"key":"30_CR4","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1007\/BF02945125","volume":"3","author":"A. Ehrenfeucht","year":"1973","unstructured":"Ehrenfeucht, A.: Polynomial functions with exponentiation are well ordered. Algebra Universalis\u00a03, 261\u2013262 (1973)","journal-title":"Algebra Universalis"},{"key":"30_CR5","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1016\/S0304-3975(97)00002-9","volume":"193","author":"M.A. Esbelin","year":"1998","unstructured":"Esbelin, M.A., More, M.: Rudimentary relations and primitive recursion: A toolbox. Theoretical Computer Science\u00a0193, 129\u2013148 (1998)","journal-title":"Theoretical Computer Science"},{"doi-asserted-by":"crossref","unstructured":"Gandy, R.: Some relations between classes of low computational complexity. Bulletin of London Mathematical Society, pp. 127\u2013134 (1984)","key":"30_CR6","DOI":"10.1112\/blms\/16.2.127"},{"key":"30_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1007\/3-540-53414-8_37","volume-title":"Aspects and Prospects of Theoretical Computer Science","author":"A. Goerdt","year":"1990","unstructured":"Goerdt, A., Seidl, H.: Characterizing complexity classes by higher type primitive recursive definitions, part II. In: Dassow, J., Kelemen, J. (eds.) IMYCS 1990. LNCS, vol.\u00a0464, pp. 148\u2013158. Springer, Heidelberg (1990)"},{"issue":"1","key":"30_CR8","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1016\/0304-3975(92)90363-K","volume":"100","author":"A. Goerdt","year":"1992","unstructured":"Goerdt, A.: Characterizing complexity classes by higher type primitive recursive definitions. Theoretical Computer Science\u00a0100(1), 45\u201366 (1992)","journal-title":"Theoretical Computer Science"},{"unstructured":"Grzegorczyk, A.: Some classes of recursive functions. In: Rozprawy Matematyczne, Warszawa, vol.\u00a0IV (1953)","key":"30_CR9"},{"key":"30_CR10","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1017\/S0956796800003889","volume":"11","author":"N. Jones","year":"2001","unstructured":"Jones, N.: The expressive power of higher-order types or, life without CONS. Journal of Functional Programming\u00a011, 55\u201394 (2001)","journal-title":"Journal of Functional Programming"},{"unstructured":"Kristiansen, L.: Appendix to the present paper (2006), Available from the author\u2019s home page: \n                  \n                    http:\/\/www.iu.hio.no\/~larskri","key":"30_CR11"},{"issue":"1","key":"30_CR12","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1007\/s00037-005-0191-0","volume":"14","author":"L. Kristiansen","year":"2005","unstructured":"Kristiansen, L.: Neat function algebraic characterizations of LOGSPACE and LINSPACE. Computational Complexity\u00a014(1), 72\u201388 (2005)","journal-title":"Computational Complexity"},{"key":"30_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"252","DOI":"10.1007\/11494645_32","volume-title":"New Computational Paradigms","author":"L. Kristiansen","year":"2005","unstructured":"Kristiansen, L., Barra, G.: The small Grzegorczyk classes and the typed \u03bb-calculus. In: Cooper, S.B., L\u00f6we, B., Torenvliet, L. (eds.) CiE 2005. LNCS, vol.\u00a03526, pp. 252\u2013262. Springer, Heidelberg (2005)"},{"key":"30_CR14","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1016\/j.ipl.2003.08.010","volume":"88","author":"L. Kristiansen","year":"2003","unstructured":"Kristiansen, L., Voda, P.: Complexity classes and fragments of C. Information Processing Letters\u00a088, 213\u2013218 (2003)","journal-title":"Information Processing Letters"},{"key":"30_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1007\/978-3-540-45220-1_28","volume-title":"Computer Science Logic","author":"L. Kristiansen","year":"2003","unstructured":"Kristiansen, L., Voda, P.: The surprising power of restricted programs and g\u00f6del\u2019s functionals. In: Baaz, M., Makowsky, J.A. (eds.) CSL 2003. LNCS, vol.\u00a02803, pp. 345\u2013358. Springer, Heidelberg (2003)"},{"key":"30_CR16","first-page":"1","volume":"12","author":"L. Kristiansen","year":"2005","unstructured":"Kristiansen, L., Voda, P.: Programming languages capturing complexity classes. Nordic Journal of Computing\u00a012, 1\u201327 (2005); Special issue for NWPT 2004","journal-title":"Nordic Journal of Computing"},{"key":"30_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"654","DOI":"10.1007\/11750321_62","volume-title":"Theory and Applications of Models of Computation","author":"L. Kristiansen","year":"2006","unstructured":"Kristiansen, L., Voda, P.: The trade-off theorem and fragments of g\u00f6del\u2019s t. In: Cai, J.-Y., Cooper, S.B., Li, A. (eds.) TAMC 2006. LNCS, vol.\u00a03959, pp. 654\u2013674. Springer, Heidelberg (2006)"},{"issue":"2","key":"30_CR18","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1112\/jlms\/s2-36.2.193","volume":"36","author":"M. Kutylowski","year":"1987","unstructured":"Kutylowski, M.: Small Grzegorczyk classes. Journal of the London Mathematical Society\u00a036(2), 193\u2013210 (1987)","journal-title":"Journal of the London Mathematical Society"},{"key":"30_CR19","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1007\/BF02485393","volume":"8","author":"H. Levitz","year":"1978","unstructured":"Levitz, H.: An ordinal bound for the set of polynomial functions with exponentiation. Algebra Universalis\u00a08, 233\u2013244 (1978)","journal-title":"Algebra Universalis"},{"key":"30_CR20","volume-title":"Classical recursion theory","author":"P. Odifreddi","year":"1999","unstructured":"Odifreddi, P.: Classical recursion theory, vol.\u00a0II. North-Holland Publishing Co., Amsterdam (1999)"},{"key":"30_CR21","series-title":"Lecture Notes in Mathematics","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1007\/BFb0075316","volume-title":"Methods in mathematical logic","author":"J. Paris","year":"1985","unstructured":"Paris, J., Wilkie, A.: Counting problems in bounded arithmetic. In: Methods in mathematical logic. Proceedings, Caracas 1983. Lecture Notes in Mathematics, vol.\u00a01130, pp. 317\u2013340. Springer, Heidelberg (1985)"},{"key":"30_CR22","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1090\/S0002-9947-1963-0158822-2","volume":"106","author":"R.W. Ritchie","year":"1963","unstructured":"Ritchie, R.W.: Classes of predictably computable functions. Transactions of the American Mathematical Society\u00a0106, 139\u2013173 (1963)","journal-title":"Transactions of the American Mathematical Society"},{"unstructured":"Rose, H.: Subrecursion. In: Functions and hierarchies. Clarendon Press (1984)","key":"30_CR23"},{"key":"30_CR24","first-page":"533","volume-title":"Handbook of computability theory","author":"H. Schwichtenberg","year":"1996","unstructured":"Schwichtenberg, H.: Classifying recursive functions. In: Griffor, E. (ed.) Handbook of computability theory, pp. 533\u2013586. Elsevier, Amsterdam (1996)"},{"issue":"12","key":"30_CR25","first-page":"54","volume":"29","author":"T. Skolem","year":"1956","unstructured":"Skolem, T.: An ordered set of arithmetic functions representing the least \u03b5-number. Det Kongelige Norske Videnskabers Selskabs Forhandlinger\u00a029(12), 54\u201359 (1956)","journal-title":"Det Kongelige Norske Videnskabers Selskabs Forhandlinger"}],"container-title":["Lecture Notes in Computer Science","Logical Approaches to Computational Barriers"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11780342_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,11]],"date-time":"2019-03-11T22:45:11Z","timestamp":1552344311000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11780342_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540354666","9783540354680"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/11780342_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}