{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T21:31:45Z","timestamp":1757626305470,"version":"3.44.0"},"reference-count":9,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[1986,1,1]],"date-time":"1986-01-01T00:00:00Z","timestamp":504921600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1986,1,1]],"date-time":"1986-01-01T00:00:00Z","timestamp":504921600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2004,5,4]],"date-time":"2004-05-04T00:00:00Z","timestamp":1083628800000},"content-version":"vor","delay-in-days":6698,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Annals of Pure and Applied Logic"],"published-print":{"date-parts":[[1986]]},"DOI":"10.1016\/0168-0072(86)90057-6","type":"journal-article","created":{"date-parts":[[2003,5,12]],"date-time":"2003-05-12T18:40:50Z","timestamp":1052764850000},"page":"291-297","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":1,"special_numbering":"C","title":["On the impossibility of explicit upper bounds on lengths of some provably finite algorithms in computable analysis"],"prefix":"10.1016","volume":"32","author":[{"given":"Andre","family":"Scedrov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"year":"1980","author":"Aberth","series-title":"Computable Analysis","key":"10.1016\/0168-0072(86)90057-6_BIB1"},{"key":"10.1016\/0168-0072(86)90057-6_BIB2","doi-asserted-by":"crossref","first-page":"630","DOI":"10.2307\/2274195","article-title":"Church's Thesis, continuity, and set theory","volume":"49","author":"Beeson","year":"1984","journal-title":"J. Symbolic Logic"},{"key":"10.1016\/0168-0072(86)90057-6_BIB3","first-page":"49","article-title":"Algorifmicheskie operatory v konstruktivnykh polnykh separabel'nykh metrischeskikh prostranstvakh","volume":"128","author":"Ce\u01d0tin","year":"1959","journal-title":"Doklady Akad. Nauk SSSR"},{"key":"10.1016\/0168-0072(86)90057-6_BIB4","series-title":"Cambridge Summer School in Mathematical Logic 1971","first-page":"113","article-title":"Some applications of Kleene's methods for intuitionistic systems","volume":"337","author":"Friedman","year":"1973"},{"key":"10.1016\/0168-0072(86)90057-6_BIB5","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1016\/0001-8708(85)90036-2","article-title":"Arithmetic transfinite induction and recursive well-orderings","volume":"56","author":"Friedman","year":"1985","journal-title":"Advances in Math."},{"key":"10.1016\/0168-0072(86)90057-6_BIB6","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0001-8708(85)90103-3","article-title":"The lack of definable witnesses and provably recursive functions in intuitionistic set theories","volume":"57","author":"Friedman","year":"1985","journal-title":"Advances in Math."},{"key":"10.1016\/0168-0072(86)90057-6_BIB7","series-title":"Constructivity in Mathematics, Proceedings Amsterdam 1957","first-page":"290","article-title":"Partial recursive functionals and effective operations","author":"Kreisel","year":"1959"},{"key":"10.1016\/0168-0072(86)90057-6_BIB8","article-title":"Lecture on Constructive Mathematical Analysis","volume":"60","author":"Kushner","year":"1984"},{"key":"10.1016\/0168-0072(86)90057-6_BIB9","doi-asserted-by":"crossref","first-page":"215","DOI":"10.4064\/fm-55-3-215-238","article-title":"Recursive metric spaces","volume":"55","author":"Moschovakis","year":"1964","journal-title":"Fundam. Math."}],"container-title":["Annals of Pure and Applied Logic"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0168007286900576?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0168007286900576?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,9]],"date-time":"2025-09-09T21:39:27Z","timestamp":1757453967000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0168007286900576"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986]]},"references-count":9,"alternative-id":["0168007286900576"],"URL":"https:\/\/doi.org\/10.1016\/0168-0072(86)90057-6","relation":{},"ISSN":["0168-0072"],"issn-type":[{"type":"print","value":"0168-0072"}],"subject":[],"published":{"date-parts":[[1986]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"On the impossibility of explicit upper bounds on lengths of some provably finite algorithms in computable analysis","name":"articletitle","label":"Article Title"},{"value":"Annals of Pure and Applied Logic","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/0168-0072(86)90057-6","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1986 Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}