{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:36:33Z","timestamp":1725456993597},"publisher-location":"Berlin\/Heidelberg","reference-count":15,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"3540528261"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0032065","type":"book-chapter","created":{"date-parts":[[2005,12,11]],"date-time":"2005-12-11T06:05:31Z","timestamp":1134281131000},"page":"660-673","source":"Crossref","is-referenced-by-count":3,"title":["Provable computable functions on abstract data types"],"prefix":"10.1007","author":[{"given":"J. V.","family":"Tucker","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S. S.","family":"Wainer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J. I.","family":"Zucker","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"49_CR1","unstructured":"C.S. Copestake, S.S. Wainer, A proof theoretic approach to the termination of computer programs, Report 26.88, Centre for Theoretical Computer Science, University of Leeds, 1988."},{"key":"49_CR2","unstructured":"R.L. Constable et al., \u201cImplementing Mathematics with the Nuprl Development System,\u201d Prentice-Hall, 1986."},{"key":"49_CR3","unstructured":"J.H. Gallier, \u201cLogic for Computer Science,\u201d Harper & Row, 1986."},{"key":"49_CR4","unstructured":"G. Gentzen, Investigations into logical deduction, in \u201cThe Collected Papers of Gerhard Gentzen,\u201d (ed. M.E. Szabo), North-Holland, 1969."},{"key":"49_CR5","unstructured":"S.C. Kleene, \u201cIntroduction to Metamathematics,\u201d North-Holland, 1952."},{"key":"49_CR6","doi-asserted-by":"crossref","unstructured":"G. Kreisel, A survey of proof theory II, in \u201cProc. Second Scandinavian Logic Symposium,\u201d (ed. J.E. Fenstad), North-Holland, 1971.","DOI":"10.1016\/S0049-237X(08)70845-0"},{"key":"49_CR7","doi-asserted-by":"crossref","unstructured":"J.W. Lloyd, \u201cFoundations of Logic Programming,\u201d (Second edition), Springer-Verlag, 1987.","DOI":"10.1007\/978-3-642-83189-8"},{"key":"49_CR8","unstructured":"K. Meinke and J.V. Tucker, Universal algebra, in \u201cHandbook of Logic in Computer Science,\u201d (ed. S. Abramsky, D. Gabbay, T. Maibaum), Oxford University Press, 1990 (to appear)."},{"key":"49_CR9","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1007\/BF01117472","volume":"1","author":"G. Mints","year":"1973","unstructured":"G. Mints, Quantifier-free and one-quantifier systems, J. Soviet Math. 1 (1973), 71\u201384.","journal-title":"J. Soviet Math."},{"key":"49_CR10","doi-asserted-by":"crossref","first-page":"587","DOI":"10.1017\/S0022481200127069","volume":"36","author":"C. Parsons","year":"1971","unstructured":"C. Parsons, On a number theoretic choice scheme II, (Abstract), J. Symbolic Logic 36 (1971), p. 587.","journal-title":"J. Symbolic Logic"},{"key":"49_CR11","doi-asserted-by":"crossref","first-page":"466","DOI":"10.2307\/2272731","volume":"37","author":"C. Parsons","year":"1972","unstructured":"C. Parsons, On n-quantifier induction, J. Symbolic Logic 37 (1972), 466\u2013482.","journal-title":"J. Symbolic Logic"},{"key":"49_CR12","unstructured":"G. Takeuti, \u201cProof Theory,\u201d (2nd edition), North-Holland, 1987."},{"key":"49_CR13","series-title":"CWI Monograph","volume-title":"Program Correctness over Abstract Data Types, with Error-State Semantics","author":"J.V. Tucker","year":"1988","unstructured":"J.V. Tucker and J.I. Zucker, \u201cProgram Correctness over Abstract Data Types, with Error-State Semantics,\u201d CWI Monograph 6, North-Holland and the Centre for Mathematics and Computer Science (CWI), Amsterdam, 1988."},{"key":"49_CR14","doi-asserted-by":"crossref","first-page":"745","DOI":"10.1007\/BFb0035796","volume":"372","author":"J. V. Tucker","year":"1989","unstructured":"J. V. Tucker and J. I. Zucker, Horn programs and semicomputable relations on abstract structures, in \u201cProc. 16th International Colloquium on Automata, Languages and Programming, Stresa, Italy,\u201d Lecture Notes in Computer Science 372, Springer-Verlag, 1989, pp. 745\u2013760.","journal-title":"Lecture Notes in Computer Science"},{"key":"49_CR15","unstructured":"S.S. Wainer, Computability \u2014 logical and recursive complexity, in \u201cProc. NATO International Summer School on Logic, Algebra and Computation, Marktoberdorf, July\u2013Aug. 1989,\u201d Springer-Verlag, 1990."}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0032065.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,9]],"date-time":"2020-12-09T22:05:37Z","timestamp":1607551537000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0032065"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["3540528261"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/bfb0032065","relation":{},"subject":[]}}