{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T16:54:50Z","timestamp":1649091290173},"reference-count":10,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1978,12,1]],"date-time":"1978-12-01T00:00:00Z","timestamp":281318400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Arch math Logik"],"published-print":{"date-parts":[[1978,12]]},"DOI":"10.1007\/bf02011873","type":"journal-article","created":{"date-parts":[[2005,8,11]],"date-time":"2005-08-11T13:32:17Z","timestamp":1123767137000},"page":"115-129","source":"Crossref","is-referenced-by-count":2,"title":["The operator gap theorem in \u03b1-recursion theory"],"prefix":"10.1007","volume":"19","author":[{"given":"Robert A.","family":"Paola","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF02011873_CR1","doi-asserted-by":"crossref","first-page":"322","DOI":"10.1145\/321386.321395","volume":"14","author":"M. Blum","year":"1967","unstructured":"Blum, M.: A machine-independent theory of the complexity of recursive functions. Journal of the Association of Computing Machinery14, 322\u2013336 (1967).","journal-title":"Journal of the Association of Computing Machinery"},{"key":"BF02011873_CR2","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1145\/321679.321692","volume":"19","author":"R.L. Constable","year":"1972","unstructured":"Constable, R.L.: The operator gap. Journal of the Association of Computing Machinery19, 175\u2013183 (1972).","journal-title":"Journal of the Association of Computing Machinery"},{"key":"BF02011873_CR3","unstructured":"Di Paola, R.A.: The operator gap theorem in \u03b1-recursion theory. Notices of the American Mathematical Society, Vol. 23, No. 5, August 1976, p. A-504."},{"issue":"1","key":"BF02011873_CR4","doi-asserted-by":"crossref","first-page":"47","DOI":"10.2307\/2272317","volume":"42","author":"B. Jacobs","year":"1977","unstructured":"Jacobs, B.: On generalized computational complexity. The Journal of Symbolic Logic, Vol. 42, No. 1, pp. 47\u201358 (1977).","journal-title":"The Journal of Symbolic Logic"},{"key":"BF02011873_CR5","unstructured":"Jacobs, B.: \u03b1-Naming and \u03b1-speedup theorems (to appear in the Notre Dame Jour. of Formal Logic)."},{"key":"BF02011873_CR6","first-page":"195","volume-title":"Constructivity in mathematics: proceedings of the colloquium held at Amsterdam","author":"G. Kreisel","year":"1957","unstructured":"Kreisel, G., Lacombe, D., Shoenfield, J.R.: Partial recursive functionals and effective operations. In: Heyting, A. (ed.): Constructivity in mathematics: proceedings of the colloquium held at Amsterdam, pp. 195\u2013207. Amsterdam: North-Holland Publ. Co. 1957."},{"key":"BF02011873_CR7","unstructured":"Kripke, S.: The theory of transfinite recursions (unpublished class notes by A.T. Tymoczko)."},{"key":"BF02011873_CR8","doi-asserted-by":"crossref","unstructured":"McCreight, E., Meyer, A.: Classes of computable functions defined by bounds on computation. Preliminary report, Proceedings of ACM Symposium on Theory of Computing (1969), pp. 79\u201388.","DOI":"10.1145\/800169.805423"},{"key":"BF02011873_CR9","series-title":"Tech. Rep.","volume-title":"Degrees of difficulty of computing a function and a partial ordering of recursive sets","author":"M.O. Rabin","year":"1960","unstructured":"Rabin, M.O.: Degrees of difficulty of computing a function and a partial ordering of recursive sets. Tech. Rep. 2, Hebrew University, Jerusalem (1960)."},{"key":"BF02011873_CR10","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1016\/0003-4843(72)90004-6","volume":"4","author":"G. E. Sacks","year":"1972","unstructured":"Sacks, G. E., Simpson, S.: The \u03b1-finite injury method. Ann. Math. Logic4, 343\u2013368 (1972).","journal-title":"Ann. Math. Logic"}],"container-title":["Archiv f\u00fcr Mathematische Logik und Grundlagenforschung"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02011873.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02011873\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02011873","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,13]],"date-time":"2019-05-13T18:24:58Z","timestamp":1557771898000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02011873"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1978,12]]},"references-count":10,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1978,12]]}},"alternative-id":["BF02011873"],"URL":"https:\/\/doi.org\/10.1007\/bf02011873","relation":{},"ISSN":["0933-5846","1432-0665"],"issn-type":[{"value":"0933-5846","type":"print"},{"value":"1432-0665","type":"electronic"}],"subject":[],"published":{"date-parts":[[1978,12]]}}}