{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,1,12]],"date-time":"2024-01-12T12:59:09Z","timestamp":1705064349804},"reference-count":6,"publisher":"Elsevier BV","issue":"5","license":[{"start":{"date-parts":[[1970,10,1]],"date-time":"1970-10-01T00:00:00Z","timestamp":23587200000},"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":15630,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Computer and System Sciences"],"published-print":{"date-parts":[[1970,10]]},"DOI":"10.1016\/s0022-0000(70)80042-3","type":"journal-article","created":{"date-parts":[[2008,1,3]],"date-time":"2008-01-03T15:37:03Z","timestamp":1199374623000},"page":"452-464","source":"Crossref","is-referenced-by-count":7,"title":["On the structure of subrecursive degrees"],"prefix":"10.1016","volume":"4","author":[{"given":"Sanat K.","family":"Basu","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0022-0000(70)80042-3_bib1","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1145\/321386.321395","article-title":"A machine-independent theory of the complexity of recursive function","volume":"14","author":"Blum","year":"1967","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/S0022-0000(70)80042-3_bib2","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1090\/S0002-9947-1959-0126377-3","article-title":"On a subrecursive hierarchy and primitive recursive degrees","volume":"92","author":"Axt","year":"1959","journal-title":"Trans. Amer. Math. Soc."},{"key":"10.1016\/S0022-0000(70)80042-3_bib3","doi-asserted-by":"crossref","unstructured":"S. C. Kleene, Extension of an effectively generated class of functions by enumeration, Colloq. Math.6, 67\u201378.","DOI":"10.4064\/cm-6-1-67-78"},{"key":"10.1016\/S0022-0000(70)80042-3_bib4","article-title":"Program Structure and Computational Complexity","author":"Ritchie","year":"1968"},{"key":"10.1016\/S0022-0000(70)80042-3_bib5","author":"Rogers","year":"1967"},{"key":"10.1016\/S0022-0000(70)80042-3_bib6","series-title":"Proceedings of the ACM Symposium on Theory of Computability","article-title":"On classes of computable functions","author":"Basu","year":"1969"}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0022000070800423?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0022000070800423?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,5,6]],"date-time":"2019-05-06T13:54:17Z","timestamp":1557150857000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0022000070800423"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1970,10]]},"references-count":6,"journal-issue":{"issue":"5","published-print":{"date-parts":[[1970,10]]}},"alternative-id":["S0022000070800423"],"URL":"https:\/\/doi.org\/10.1016\/s0022-0000(70)80042-3","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[1970,10]]}}}