{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:56:07Z","timestamp":1725663367578},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540542339"},{"type":"electronic","value":"9783540475163"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1991]]},"DOI":"10.1007\/3-540-54233-7_143","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T22:37:39Z","timestamp":1330209459000},"page":"303-313","source":"Crossref","is-referenced-by-count":0,"title":["Provably recursive programs and program extraction"],"prefix":"10.1007","author":[{"given":"Tim","family":"Fernando","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,8]]},"reference":[{"key":"23_CR1","doi-asserted-by":"crossref","unstructured":"Manuel Blum. A machine-independent theory of the complexity of recursive functions. J. Assoc. Computing Machinery, 14, 1967.","DOI":"10.1145\/321386.321395"},{"key":"23_CR2","volume-title":"LNCS","author":"L. Colson","year":"1989","unstructured":"Loic Colson. About primitive recursive algorithms. In G. Ausiello et al, editor, Proc. ICALP '89, LNCS 372. Springer-Verlag, Berlin, 1989."},{"key":"23_CR3","doi-asserted-by":"crossref","unstructured":"Andrzej Ehrenfeucht and Jan Mycielski. Abbreviating proofs by adding new axioms. Bulletin of the American Mathematical Society, 77(3), 1971.","DOI":"10.1090\/S0002-9904-1971-12696-4"},{"key":"23_CR4","doi-asserted-by":"crossref","unstructured":"Solomon Feferman. Transfinite recursive progressions of axiomatic theories. Journal of Symbolic Logic, 27, 1962.","DOI":"10.2307\/2964649"},{"key":"23_CR5","volume-title":"Algebra and Logic, LNM 450","author":"S. Feferman","year":"1975","unstructured":"Solomon Feferman. A language and axioms for explicit mathematics. In J.N. Crossley, editor, Algebra and Logic, LNM 450. Springer-Verlag, Berlin, 1975."},{"key":"23_CR6","unstructured":"Solomon Feferman. Turing in the land of 0(z). In R. Herken, editor, The universal Turing machine. Kammerer and Unverzagt, 1988."},{"key":"23_CR7","unstructured":"Solomon Feferman. Logics for termination and correctness of functional programs, II. Leeds Proof Theory '90, to appear."},{"key":"23_CR8","unstructured":"Tim Fernando. Turing through programs of bounded complexity, In preparation."},{"key":"23_CR9","volume-title":"Proofs and Types","author":"J. Girard","year":"1989","unstructured":"Jean-Yves Girard, Yves Lafont, and Paul Taylor. Proofs and Types. Cambridge University Press, Cambridge, 1989."},{"key":"23_CR10","unstructured":"Kurt G\u00f6del. Zur intuitionistischen arithemetik und zahlentheorie. In Collected works, volume I. Oxford University Press, 1986."},{"key":"23_CR11","doi-asserted-by":"crossref","unstructured":"Georg Kreisel. On the interpretation of non-finitist proofs, I. Journal of Symbolic Logic, 16, 1951.","DOI":"10.2307\/2267908"},{"key":"23_CR12","volume-title":"Intuitionism and Proof Theory","author":"C. Parsons","year":"1970","unstructured":"Charles Parsons. On a number-theoretic choice schema and its relation to induction. In J. Myhill, editor, Intuitionism and Proof Theory. North-Holland, Amsterdam, 1970."}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-54233-7_143.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:53:13Z","timestamp":1605646393000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-54233-7_143"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991]]},"ISBN":["9783540542339","9783540475163"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-54233-7_143","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1991]]}}}