{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,24]],"date-time":"2025-09-24T18:10:31Z","timestamp":1758737431116,"version":"3.44.0"},"reference-count":71,"publisher":"Elsevier","isbn-type":[{"type":"print","value":"9780444898821"}],"license":[{"start":{"date-parts":[[1999,1,1]],"date-time":"1999-01-01T00:00:00Z","timestamp":915148800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1999,1,1]],"date-time":"1999-01-01T00:00:00Z","timestamp":915148800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1016\/s0049-237x(99)80032-9","type":"book-chapter","created":{"date-parts":[[2007,9,7]],"date-time":"2007-09-07T16:52:47Z","timestamp":1189183967000},"page":"533-586","source":"Crossref","is-referenced-by-count":4,"title":["Classifying Recursive Functions"],"prefix":"10.1016","member":"78","reference":[{"key":"10.1016\/S0049-237X(99)80032-9_bib1","doi-asserted-by":"crossref","first-page":"162","DOI":"10.1007\/BF01450016","article-title":"Zur Widerspruchsfreiheit der Zahlentheorie","volume":"117","author":"Ackermann","year":"1940","journal-title":"Math. Ann."},{"journal-title":"Totale Objekte und Mengen in der Bereichstheorie","year":"1990","author":"Berger","key":"10.1016\/S0049-237X(99)80032-9_bib2"},{"key":"10.1016\/S0049-237X(99)80032-9_bib3","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1016\/0168-0072(93)90038-F","article-title":"Total sets and objects in domain theory","volume":"60","author":"Berger","year":"1993","journal-title":"Ann. Pure Appl. Logic"},{"key":"10.1016\/S0049-237X(99)80032-9_bib4","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1007\/BF01621472","article-title":"Notation systems for infinitary derivations","volume":"30","author":"Buchholz","year":"1991","journal-title":"Arch. Math. Logic"},{"key":"10.1016\/S0049-237X(99)80032-9_bib5","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1002\/malq.19940400212","article-title":"A uniform approach to fundamental sequences and hierarchies","volume":"40","author":"Buchholz","year":"1994","journal-title":"Math. Logic Quart"},{"key":"10.1016\/S0049-237X(99)80032-9_bib6","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1090\/conm\/065\/891248","article-title":"Provably computable functions and the fast growing hierarchy","volume":"65","author":"Buchholz","year":"1987","journal-title":"Logic and Combinatorics"},{"key":"10.1016\/S0049-237X(99)80032-9_bib7","first-page":"XX","article-title":"Computation models and function algebras","author":"Clote","year":"1999"},{"key":"10.1016\/S0049-237X(99)80032-9_bib8","unstructured":"A. COBHAM [1965] The intrinsic computational difficulty of functions, in: Logic, Methodology and Philosophy ofScience II, Y. Bar-Hillel, ed., North-Holland, Amsterdam, pp. 24-30."},{"key":"10.1016\/S0049-237X(99)80032-9_bib9","first-page":"51","article-title":"Computability and complexity of higher type functions","volume":"21","author":"Cook","year":"1992"},{"key":"10.1016\/S0049-237X(99)80032-9_bib10","first-page":"55","article-title":"Reduction relations in strict applicative languages","volume":"601","author":"DOSCH","year":"1992"},{"issue":"4","key":"10.1016\/S0049-237X(99)80032-9_bib11","first-page":"367","article-title":"Computable functionals of finite types","volume":"11","author":"Ershov","year":"1972","journal-title":"Algebra i Logika"},{"issue":"4","key":"10.1016\/S0049-237X(99)80032-9_bib12","first-page":"374","article-title":"Maximal and everywhere defined functionals","volume":"13","author":"Ershov","year":"1974","journal-title":"Algebra i Logika"},{"key":"10.1016\/S0049-237X(99)80032-9_bib13","doi-asserted-by":"crossref","unstructured":"Yu. L. ERSHOV [1977] Model C of partial continuous functionals, in: Logic Colloquium 1976, R. Gandy and M. Hyland,eds., North-Holland, Amsterdam, pp. 455\u2013467.","DOI":"10.1016\/S0049-237X(09)70439-2"},{"key":"10.1016\/S0049-237X(99)80032-9_bib14","doi-asserted-by":"crossref","unstructured":"M. V. H. FAIRTLOUGH AND S. S. WAINER[1998] Hierarchies of provably recursive functions, in: Handbook of Proof Theory, S. Buss, ed., North-Holland, Amsterdam, pp. 149-207.","DOI":"10.1016\/S0049-237X(98)80018-9"},{"issue":"1","key":"10.1016\/S0049-237X(99)80032-9_bib15","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1145\/322358.322370","article-title":"The expressiveness of simple and second-order type structures","volume":"30","author":"Fortune","year":"1983","journal-title":"J. Assoc. Comput. Machin."},{"key":"10.1016\/S0049-237X(99)80032-9_bib16","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0168-0072(94)00003-L","article-title":"Elementary descent recursion and proof theory","volume":"71","author":"Friedman","year":"1995","journal-title":"Ann. Pure Appl. Logic"},{"key":"10.1016\/S0049-237X(99)80032-9_bib17","doi-asserted-by":"crossref","unstructured":"R. O. GANDY AND J. M. E. HYLAND[1977] Computable and recursively countable functions of higher type, in: Logic Colloquium 76,North-Holland, Amsterdam, pp. 407-438.","DOI":"10.1016\/S0049-237X(09)70437-9"},{"key":"10.1016\/S0049-237X(99)80032-9_bib18","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/0003-4843(81)90016-4","article-title":"\u03a021-logic. Part I: Dilators","volume":"21","author":"Girard","year":"1981","journal-title":"Ann. Math. Logic"},{"key":"10.1016\/S0049-237X(99)80032-9_bib19","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 Standpunkts","volume":"12","author":"G\u00d6del","year":"1958","journal-title":"Dialectica"},{"key":"10.1016\/S0049-237X(99)80032-9_bib20","volume":"IV","author":"Grzegorczyk","year":"1953","journal-title":"Some Classes of Recursive Functions"},{"key":"10.1016\/S0049-237X(99)80032-9_bib21","first-page":"87","article-title":"A theorem concerning the infinite cardinal numbers","volume":"35","author":"Hardy","year":"1904","journal-title":"Quart. J. Math."},{"year":"1978","author":"Hinman","key":"10.1016\/S0049-237X(99)80032-9_bib22"},{"key":"10.1016\/S0049-237X(99)80032-9_bib23","doi-asserted-by":"crossref","first-page":"67","DOI":"10.4064\/cm-6-1-67-78","article-title":"Extension of an effectively generated class of functions by enumeration","volume":"7","author":"KLEENE","year":"1958","journal-title":"Colloq. Math."},{"key":"10.1016\/S0049-237X(99)80032-9_bib24","doi-asserted-by":"crossref","unstructured":"S. C. KLEENE [1959b] Recursive functionals and quantifiers of finite types I, Trans. Amer. Math. Soc, 91, pp. 1-52.","DOI":"10.1090\/S0002-9947-1959-0102480-9"},{"key":"10.1016\/S0049-237X(99)80032-9_bib25","first-page":"1","article-title":"Recursive functionals and quantifiers of finite types I","volume":"91","author":"KLEENE","year":"1959","journal-title":"Trans. Amer. Math. Soc"},{"key":"10.1016\/S0049-237X(99)80032-9_bib26","doi-asserted-by":"crossref","unstructured":"S. C. KLEENE [1962] Turing machine computable functionals of finite types I, in: Proc. of the Congress for Logic,Methodology and the Philosophy of Science, E. Nagel et al., eds., Stanford, pp. 38-45.","DOI":"10.1016\/S0049-237X(09)70568-3"},{"key":"10.1016\/S0049-237X(99)80032-9_bib27","doi-asserted-by":"crossref","first-page":"43","DOI":"10.2307\/2267457","article-title":"On the interpretation of non-finitist proofs II","volume":"17","author":"Kreisel","year":"1952","journal-title":"J. Symbolic Logic"},{"key":"10.1016\/S0049-237X(99)80032-9_bib28","unstructured":"G. KREISEL [1959] Interpretation of analysis by means of constructive functionals of finite types, in\u2033 Constructivity in Mathematics, A. Heyting, ed., North-Holland, Amsterdam, pp. 101-128."},{"key":"10.1016\/S0049-237X(99)80032-9_bib29","doi-asserted-by":"crossref","first-page":"232","DOI":"10.1016\/0890-5401(91)90068-D","article-title":"Using information systems to solve recursive domain equations","volume":"91","author":"Larsen","year":"1991","journal-title":"Information and Computation"},{"key":"10.1016\/S0049-237X(99)80032-9_bib30","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1007\/BF01967649","article-title":"Hierarchies of number-theoretic functions I","volume":"13","author":"L\u00f6b","year":"1970","journal-title":"Arch. Math. Logik Grundlagenforschung"},{"key":"10.1016\/S0049-237X(99)80032-9_bib31","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1007\/BF01973616","article-title":"Hierarchies of number-theoretic functions II","volume":"13","author":"L\u00f6b","year":"1970","journal-title":"Arch. Math. Logik Grundlagenforschung"},{"key":"10.1016\/S0049-237X(99)80032-9_bib32","doi-asserted-by":"crossref","first-page":"437","DOI":"10.2307\/1970290","article-title":"Recursive unsolvability of Post's problem of \u201cTag\u201d and other topics in the theory of Turing machines","volume":"74","author":"MINSKY","year":"1961","journal-title":"Ann. Math."},{"key":"10.1016\/S0049-237X(99)80032-9_bib33","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1007\/BF01117472","article-title":"Quantifier-free and one-quantifier systems","volume":"1","author":"Mints","year":"1973","journal-title":"J. Soviet Math."},{"key":"10.1016\/S0049-237X(99)80032-9_bib34","doi-asserted-by":"crossref","first-page":"548","DOI":"10.1007\/BF01091743","article-title":"Finite investigations of transfinite derivations","volume":"10","author":"Mints","year":"1978","journal-title":"J. Soviet Math."},{"key":"10.1016\/S0049-237X(99)80032-9_bib35","unstructured":"G. E. MINTS [1992] Selected Papers in Proof Theory, Studies in Proof Theory, Bibliopolis Napoli and North-Holland, Amsterdam."},{"volume":"811","year":"1977","author":"MOLDESTAD","key":"10.1016\/S0049-237X(99)80032-9_bib36"},{"key":"10.1016\/S0049-237X(99)80032-9_bib37","first-page":"190","article-title":"A stumblingblock in constructive mathematics (abstract)","volume":"18","author":"Myhill","year":"1953","journal-title":"J. Symbolic Logic"},{"key":"10.1016\/S0049-237X(99)80032-9_bib38","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1007\/BF01387405","article-title":"Subrecursive hierarchies on Scott domains","volume":"32","author":"Niggl","year":"1993","journal-title":"Arch. Math. Logic"},{"journal-title":"Subrecursive Hierarchies on the Partial Continuous Functionals","year":"1994","author":"Niggl","key":"10.1016\/S0049-237X(99)80032-9_bib39"},{"key":"10.1016\/S0049-237X(99)80032-9_bib40","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1016\/0168-0072(94)00062-8","article-title":"Towards the computational complexity of PR?-terms","volume":"75","author":"Niggl","year":"1995","journal-title":"Ann. Pure Appl. Logic"},{"key":"10.1016\/S0049-237X(99)80032-9_bib41","first-page":"251","article-title":"The continuous functionals","author":"NORMANN","year":"1999"},{"year":"1957","author":"P\u00e9ter","key":"10.1016\/S0049-237X(99)80032-9_bib42"},{"year":"1966","author":"Platek","key":"10.1016\/S0049-237X(99)80032-9_bib43"},{"key":"10.1016\/S0049-237X(99)80032-9_bib44","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1016\/0304-3975(77)90044-5","article-title":"LCF considered as a programming language","volume":"5","author":"Plotkin","year":"1977","journal-title":"Theoret. Comput. Sci."},{"year":"1965","author":"Robbin","key":"10.1016\/S0049-237X(99)80032-9_bib45"},{"year":"1967","author":"Rogers","key":"10.1016\/S0049-237X(99)80032-9_bib46"},{"volume":"9","year":"1984","author":"Rose","key":"10.1016\/S0049-237X(99)80032-9_bib47"},{"key":"10.1016\/S0049-237X(99)80032-9_bib48","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1017\/S0305004100028255","article-title":"Ordinal recursion","volume":"49","author":"Routledge","year":"1953","journal-title":"Proc. Cambridge Phil. Soc"},{"year":"1990","author":"Sacks","key":"10.1016\/S0049-237X(99)80032-9_bib49"},{"key":"10.1016\/S0049-237X(99)80032-9_bib50","doi-asserted-by":"crossref","first-page":"369","DOI":"10.1007\/BF01342849","article-title":"Beweistheoretische Erfassung der unendlichen Induktion in der Zahlentheorie","volume":"122","author":"Sch\u00dctte","year":"1951","journal-title":"Math. Ann."},{"key":"10.1016\/S0049-237X(99)80032-9_bib51","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/BF01982053","article-title":"Rekursionszahlen und die Grzegorczyk-Hierarchie","volume":"12","author":"SCHWICHTENBERG","year":"1969","journal-title":"Arch. Math. Logik Grundlagenforschung"},{"key":"10.1016\/S0049-237X(99)80032-9_bib52","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1002\/malq.19710170113","article-title":"Eine Klassifikation der epsivo-rekursiven Funktionen","volume":"17","author":"SCHWICHTENBERG","year":"1971","journal-title":"Zeits. Math. Logik Grundl. Math."},{"key":"10.1016\/S0049-237X(99)80032-9_bib53","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1007\/BF02008530","article-title":"Beweistheoretische Charakterisierung einer Erweiterung der Grzegorczyk-Hierarchie","volume":"15","author":"SCHWICHTENBERG","year":"1972","journal-title":"Arch. Math. Logik Grundlagenforschung"},{"journal-title":"Einige Anwendungen von unendlichen Termen und Wertfunktionalen","year":"1973","author":"SCHWICHTENBERG","key":"10.1016\/S0049-237X(99)80032-9_bib54"},{"key":"10.1016\/S0049-237X(99)80032-9_bib55","doi-asserted-by":"crossref","unstructured":"H. SCHWICHTENBERG [1975] Elimination of higher type levels in definitions of primitive recursive functionals by meansof transfinite recursion, Logic Colloquium '73, in: H. E. Rose and J. C. Shepherdson, eds.,North-Holland, Amsterdam, pp. 279-303.","DOI":"10.1016\/S0049-237X(08)71953-0"},{"key":"10.1016\/S0049-237X(99)80032-9_bib56","doi-asserted-by":"crossref","unstructured":"H. SCHWICHTENBERG [1977] Proof theory: Some applications of cut-elimination, in: Handbook of Mathematical Logic,J. Barwise, ed., Studies in Logic and the Foundations of Mathematics, Vol. 90, North-Holland,Amsterdam, pp. 867-895.","DOI":"10.1016\/S0049-237X(08)71124-8"},{"key":"10.1016\/S0049-237X(99)80032-9_bib57","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1016\/S0168-0072(97)00073-0","article-title":"Finite notations for infinite terms","volume":"94","author":"SCHWICHTENBERG","year":"1998","journal-title":"Ann. Pure Appl. Logic"},{"key":"10.1016\/S0049-237X(99)80032-9_bib58","first-page":"387","article-title":"Ordinal bounds for programs","author":"SCHWICHTENBERG","year":"1995"},{"year":"1970","author":"Scott","key":"10.1016\/S0049-237X(99)80032-9_bib59"},{"key":"10.1016\/S0049-237X(99)80032-9_bib60","first-page":"577","article-title":"Domains for denotational semantics","volume":"140","author":"Scott","year":"1982"},{"key":"10.1016\/S0049-237X(99)80032-9_bib61","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1145\/321160.321170","article-title":"Computability of recursive functions","volume":"10","author":"Shepherdson","year":"1963","journal-title":"J. Assoc. Comput. Machin."},{"year":"1967","author":"Shoenfield","key":"10.1016\/S0049-237X(99)80032-9_bib62"},{"year":"1994","author":"STOLTENBERG-HANSEN","key":"10.1016\/S0049-237X(99)80032-9_bib63"},{"key":"10.1016\/S0049-237X(99)80032-9_bib64","doi-asserted-by":"crossref","first-page":"236","DOI":"10.1007\/BF01342980","article-title":"Nested recursion","volume":"143","author":"Tait","year":"1961","journal-title":"Math. Ann."},{"key":"10.1016\/S0049-237X(99)80032-9_bib65","doi-asserted-by":"crossref","unstructured":"W. W. TAIT [1965] Infinitely long terms of transfinite type, in: Formal Systems and Recursive Functions, J. Crossleyand M. Dummett, eds., North-Holland, Amsterdam, pp. 176-185.","DOI":"10.1016\/S0049-237X(08)71689-6"},{"key":"10.1016\/S0049-237X(99)80032-9_bib66","first-page":"204","article-title":"Normal derivability in classical logic","volume":"72","author":"Tait","year":"1968"},{"key":"10.1016\/S0049-237X(99)80032-9_bib67","unstructured":"G. TAKEUTI[1987] Proof Theory, 2nd edn., North-Holland, Amsterdam."},{"issue":"4","key":"10.1016\/S0049-237X(99)80032-9_bib68","doi-asserted-by":"crossref","first-page":"1274","DOI":"10.2307\/2275705","article-title":"Grzegorcyk's hierarchy and iep\u03c31","volume":"59","author":"Takeuti","year":"1994","journal-title":"J. Symbolic Logic"},{"key":"10.1016\/S0049-237X(99)80032-9_bib69","doi-asserted-by":"crossref","first-page":"136","DOI":"10.1007\/BF01973619","article-title":"A classification of the ordinal recursive functions","volume":"13","author":"WAINER","year":"1970","journal-title":"Arch. Math. Logik Grundlagenforschung"},{"key":"10.1016\/S0049-237X(99)80032-9_bib70","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1007\/BF01387511","article-title":"Investigations on slow versus fast growing: how to majorize slow growing functions nontrivially by fast growing ones","volume":"34","author":"Weiermann","year":"1995","journal-title":"Arch. Math. Logic"},{"key":"10.1016\/S0049-237X(99)80032-9_bib71","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1090\/S0002-9947-1977-0498045-0","article-title":"P.R.-regulated systems of notation and the subrecursive hierarchy equivalence property","volume":"234","author":"Zemke","year":"1977","journal-title":"Trans. Amer. Math. Soc"}],"container-title":["Studies in Logic and the Foundations of Mathematics","Handbook of Computability Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0049237X99800329?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0049237X99800329?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,24]],"date-time":"2025-09-24T17:33:58Z","timestamp":1758735238000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0049237X99800329"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9780444898821"],"references-count":71,"URL":"https:\/\/doi.org\/10.1016\/s0049-237x(99)80032-9","relation":{},"ISSN":["0049-237X"],"issn-type":[{"type":"print","value":"0049-237X"}],"subject":[],"published":{"date-parts":[[1999]]}}}