{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,12,30]],"date-time":"2022-12-30T19:52:32Z","timestamp":1672429952401},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"3-4","license":[{"start":{"date-parts":[[2007,7,4]],"date-time":"2007-07-04T00:00:00Z","timestamp":1183507200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theory Comput Syst"],"published-print":{"date-parts":[[2008,12]]},"DOI":"10.1007\/s00224-007-9021-x","type":"journal-article","created":{"date-parts":[[2007,7,3]],"date-time":"2007-07-03T16:27:36Z","timestamp":1183480056000},"page":"516-541","source":"Crossref","is-referenced-by-count":4,"title":["Complexity-Theoretic Hierarchies Induced by Fragments of G\u00f6del\u2019s T"],"prefix":"10.1007","volume":"43","author":[{"given":"Lars","family":"Kristiansen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2007,7,4]]},"reference":[{"key":"9021_CR1","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1016\/S0049-237X(98)80020-7","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, pp. 337\u2013405. Elsevier, Amsterdam (1998)"},{"key":"#cr-split#-9021_CR2.1","doi-asserted-by":"crossref","unstructured":"Bel\u2019tyukov, A.: A machine description and the hierarchy of initial Grzegorczyk classes. J. Sov. Math. (1982);","DOI":"10.1007\/BF01629435"},{"key":"#cr-split#-9021_CR2.2","unstructured":"Zap. Naucn. Sem. Leninigrad. Otdel. Mat. Inst. Steklov. (LOMI) 88, 30\u201346 (1979)"},{"key":"9021_CR3","doi-asserted-by":"crossref","first-page":"589","DOI":"10.1016\/S0049-237X(99)80033-0","volume-title":"Handbook of Computability Theory","author":"P. Clote","year":"1999","unstructured":"Clote, P.: Computation models and function algebra. In: Griffor, E. (ed.) Handbook of Computability Theory, pp. 589\u2013681. Elsevier, Amsterdam (1999)"},{"key":"9021_CR4","doi-asserted-by":"crossref","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 Univers. 3, 261\u2013262 (1973)","journal-title":"Algebra Univers."},{"key":"9021_CR5","doi-asserted-by":"crossref","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. Theor. Comput. Sci. 193, 129\u2013148 (1998)","journal-title":"Theor. Comput. Sci."},{"key":"9021_CR6","doi-asserted-by":"crossref","unstructured":"Gandy, R.: Some relations between classes of low computational complexity. Bull. Lond. Math. Soc. 127\u2013134 (1984)","DOI":"10.1112\/blms\/16.2.127"},{"key":"9021_CR7","series-title":"Lecture Notes in Comput. Sci.","doi-asserted-by":"crossref","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: Aspects and Prospects of Theoretical Computer Science, Smolenice, 1990. Lecture Notes in Comput. Sci., vol. 464, pp. 148\u2013158. Springer, New York (1990)"},{"issue":"1","key":"9021_CR8","doi-asserted-by":"crossref","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. Theor. Comput. Sci. 100(1), 45\u201366 (1992)","journal-title":"Theor. Comput. Sci."},{"key":"9021_CR9","unstructured":"Grzegorczyk, A.: Some classes of recursive functions. Rozprawy Matematyczne No. IV. Warszawa (1953)"},{"key":"9021_CR10","doi-asserted-by":"crossref","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. J. Funct. Program. 11, 55\u201394 (2001)","journal-title":"J. Funct. Program."},{"issue":"1","key":"9021_CR11","doi-asserted-by":"crossref","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. Comput. Complex. 14(1), 72\u201388 (2005)","journal-title":"Comput. Complex."},{"key":"9021_CR12","series-title":"Lecture Notes in Comput. Sci.","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1007\/11780342_30","volume-title":"CiE 2006: Logical Approaches to Computational Barriers","author":"L. Kristiansen","year":"2006","unstructured":"Kristiansen, L.: Complexity-theoretic hierarchies. In: CiE 2006: Logical Approaches to Computational Barriers. Lecture Notes in Comput. Sci., vol. 3988, pp. 279\u2013288. Springer, New York (2006)"},{"key":"9021_CR13","series-title":"Lecture Notes in Comput. Sci.","doi-asserted-by":"crossref","first-page":"252","DOI":"10.1007\/11494645_32","volume-title":"CiE 2005: New Computational Paradigms","author":"L. Kristiansen","year":"2005","unstructured":"Kristiansen, L., Barra, G.: The small Grzegorczyk classes and the typed \u03bb-calculus. In: CiE 2005: New Computational Paradigms. Lecture Notes in Comput. Sci., vol. 3526, pp. 252\u2013262. Springer, New York (2005)"},{"key":"9021_CR14","doi-asserted-by":"crossref","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. Inf. Process. Lett. 88, 213\u2013218 (2003)","journal-title":"Inf. Process. Lett."},{"key":"9021_CR15","series-title":"Lecture Notes in Comput. Sci.","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1007\/978-3-540-45220-1_28","volume-title":"CSL 2003: 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. (eds.) CSL 2003: Computer Science Logic. Lecture Notes in Comput. Sci., vol. 2803, pp. 345\u2013358. Springer, New York (2003)"},{"key":"9021_CR16","first-page":"1","volume":"12","author":"L. Kristiansen","year":"2005","unstructured":"Kristiansen, L., Voda, P.: Programming languages capturing complexity classes. Nord. J. Comput. 12, 1\u201327 (2005), Special issue for NWPT\u201904","journal-title":"Nord. J. Comput."},{"key":"9021_CR17","series-title":"Lecture Notes in Comput. Sci.","doi-asserted-by":"crossref","first-page":"654","DOI":"10.1007\/11750321_62","volume-title":"TAMC\u201906: 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: TAMC\u201906: Theory and Applications of Models of Computation. Lecture Notes in Comput. Sci., vol. 3959, pp. 654\u2013674. Springer, New York (2006)"},{"issue":"2","key":"9021_CR18","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1112\/jlms\/s2-36.2.193","volume":"36","author":"M. Kutylowski","year":"1987","unstructured":"Kutylowski, M.: Small Grzegorczyk classes. J. Lond. Math. Soc. 36(2), 193\u2013210 (1987)","journal-title":"J. Lond. Math. Soc."},{"key":"9021_CR19","doi-asserted-by":"crossref","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 Univers. 8, 233\u2013244 (1978)","journal-title":"Algebra Univers."},{"key":"9021_CR20","volume-title":"Classical Recursion Theory. Vol. II","author":"P. Odifreddi","year":"1999","unstructured":"Odifreddi, P.: Classical Recursion Theory. Vol. II. North-Holland, Amsterdam (1999)"},{"key":"9021_CR21","series-title":"Lecture Notes in Math.","doi-asserted-by":"crossref","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 Math., vol. 1130, pp. 317\u2013340. Springer, New York (1985)"},{"key":"9021_CR22","doi-asserted-by":"crossref","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. Trans. Am. Math. Soc. 106, 139\u2013173 (1963)","journal-title":"Trans. Am. Math. Soc."},{"key":"9021_CR23","volume-title":"Subrecursion. Functions and Hierarchies","author":"H. Rose","year":"1984","unstructured":"Rose, H.: Subrecursion. Functions and Hierarchies. Clarendon, Oxford (1984)"},{"key":"9021_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":"9021_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 K. Nor. Vidensk. Selsk. Forh. 29(12), 54\u201359 (1956)","journal-title":"Det K. Nor. Vidensk. Selsk. Forh."}],"container-title":["Theory of Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-007-9021-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00224-007-9021-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-007-9021-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,24]],"date-time":"2019-05-24T11:51:34Z","timestamp":1558698694000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00224-007-9021-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,7,4]]},"references-count":26,"journal-issue":{"issue":"3-4","published-print":{"date-parts":[[2008,12]]}},"alternative-id":["9021"],"URL":"https:\/\/doi.org\/10.1007\/s00224-007-9021-x","relation":{},"ISSN":["1432-4350","1433-0490"],"issn-type":[{"value":"1432-4350","type":"print"},{"value":"1433-0490","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,7,4]]}}}