{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,1]],"date-time":"2026-02-01T05:11:15Z","timestamp":1769922675780,"version":"3.49.0"},"reference-count":18,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[2000,7,1]],"date-time":"2000-07-01T00:00:00Z","timestamp":962409600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":4764,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Annals of Pure and Applied Logic"],"published-print":{"date-parts":[[2000,7]]},"DOI":"10.1016\/s0168-0072(00)00006-3","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T20:32:16Z","timestamp":1027629136000},"page":"17-30","source":"Crossref","is-referenced-by-count":50,"title":["Higher type recursion, ramification and polynomial time"],"prefix":"10.1016","volume":"104","author":[{"given":"Stephen J.","family":"Bellantoni","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Karl-Heinz","family":"Niggl","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Helmut","family":"Schwichtenberg","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0168-0072(00)00006-3_BIB1","series-title":"Logic and Computational Complexity, Springer Lecture Notes in Computer Science, Vol. 960","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1007\/3-540-60178-3_88","article-title":"Characterizing parallel polylog time using type 2 recursions with polynomial output length","author":"Bellantoni","year":"1995"},{"key":"10.1016\/S0168-0072(00)00006-3_BIB2","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1007\/BF01201998","article-title":"A new recursion-theoretic characterization of the polytime functions","volume":"2","author":"Bellantoni","year":"1992","journal-title":"Comput. Complexity"},{"key":"10.1016\/S0168-0072(00)00006-3_BIB3","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1137\/S009753979528175X","article-title":"Ranking primitive recursions","volume":"29","author":"Bellantoni","year":"2000","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0168-0072(00)00006-3_BIB4","doi-asserted-by":"crossref","unstructured":"S.A. Cook, B.M. Kapron, Characterizations of the basic feasible functionals of finite type, in: S. Buss, P. Scott (Eds.), Feasible Mathematics, Birkh\u00e4user, Boston, 1990, pp. 71\u201398.","DOI":"10.1007\/978-1-4612-3466-1_5"},{"key":"10.1016\/S0168-0072(00)00006-3_BIB5","series-title":"Computability, Complexity and Languages. Fundamentals of theoretical computer science","author":"Davis","year":"1983"},{"key":"10.1016\/S0168-0072(00)00006-3_BIB6","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1006\/inco.1998.2700","article-title":"Light linear logic","volume":"143","author":"Girard","year":"1998","journal-title":"Inform. and Comput."},{"key":"10.1016\/S0168-0072(00)00006-3_BIB7","doi-asserted-by":"crossref","first-page":"280","DOI":"10.1111\/j.1746-8361.1958.tb01464.x","article-title":"\u00dcber eine bisher noch nicht ben\u00fctzte Erweiterung des finiten Standpunktes","volume":"12","author":"G\u00f6del","year":"1958","journal-title":"Dialectica"},{"key":"10.1016\/S0168-0072(00)00006-3_BIB8","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1007\/BF01206605","article-title":"\u00dcber das Unendliche","volume":"95","author":"Hilbert","year":"1925","journal-title":"Math. Ann."},{"key":"10.1016\/S0168-0072(00)00006-3_BIB9","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1007\/BFb0028020","article-title":"A mixed modal\/linear lambda calculus with applications to Bellantoni-Cook safe recursion","volume":"1414","author":"Hofmann","year":"1998","journal-title":"Proc. CSL \u201997, Aarhus, Springer Lecture Notes in Computer Science, Vol."},{"key":"10.1016\/S0168-0072(00)00006-3_BIB10","unstructured":"M. Hofmann, Typed lambda calculi for polynomial-time computation, Habilitation Thesis, TU Darmstadt, 1998."},{"key":"10.1016\/S0168-0072(00)00006-3_BIB11","unstructured":"F. Joachimski, R. Matthes, Short proofs of normalisation for the simply-typed \u03bb-calculus, permutative conversions and G\u00f6del's T, 1998, submitted."},{"key":"10.1016\/S0168-0072(00)00006-3_BIB12","series-title":"Feasible Mathematics, Perspectives in Computer Science","first-page":"281","article-title":"Subrecursion and lambda representation over free algebras","author":"Leivant","year":"1990"},{"key":"10.1016\/S0168-0072(00)00006-3_BIB13","first-page":"227","article-title":"Predicative recurrence in finite type","volume":"Vol. 813","author":"Leivant","year":"1994"},{"key":"10.1016\/S0168-0072(00)00006-3_BIB14","series-title":"Feasible Mathematics II, Perspectives in Computer Science","first-page":"320","article-title":"Ramified recurrence and computational complexity I","author":"Leivant","year":"1994"},{"key":"10.1016\/S0168-0072(00)00006-3_BIB15","unstructured":"D. Leivant, J.-Y. Marion, Ramified recurrence and computational complexity IV: Predicative functionals and poly-space, Inform. and Comput., to appear."},{"key":"10.1016\/S0168-0072(00)00006-3_BIB16","unstructured":"K.-H. Niggl, The \u03bc-measure as a tool for classifying computational complexity, Arch. Math. Logic (1999) to appear."},{"key":"10.1016\/S0168-0072(00)00006-3_BIB17","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1007\/BF01620765","article-title":"The realm of primitive recursion","volume":"27","author":"Simmons","year":"1988","journal-title":"Arch. Math. Logic"},{"key":"10.1016\/S0168-0072(00)00006-3_BIB18","series-title":"Basic Proof Theory","author":"Troelstra","year":"1996"}],"container-title":["Annals of Pure and Applied Logic"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0168007200000063?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0168007200000063?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,21]],"date-time":"2019-04-21T09:24:55Z","timestamp":1555838695000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0168007200000063"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,7]]},"references-count":18,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[2000,7]]}},"alternative-id":["S0168007200000063"],"URL":"https:\/\/doi.org\/10.1016\/s0168-0072(00)00006-3","relation":{},"ISSN":["0168-0072"],"issn-type":[{"value":"0168-0072","type":"print"}],"subject":[],"published":{"date-parts":[[2000,7]]}}}