{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,5,31]],"date-time":"2024-05-31T07:17:20Z","timestamp":1717139840622},"reference-count":10,"publisher":"Cambridge University Press (CUP)","issue":"2","license":[{"start":{"date-parts":[[2014,3,12]],"date-time":"2014-03-12T00:00:00Z","timestamp":1394582400000},"content-version":"unspecified","delay-in-days":10511,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J. symb. log."],"published-print":{"date-parts":[[1985,6]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>We define, in the spirit of Fenstad [2], a higher type computation theory, and show that countable recursion over the continuous functionals forms such a theory. We also discuss Hyland's proposal from [4] for a scheme with which to supplement S1\u2013S9, and show that this augmented set of schemes fails to generate countable recursion. We make another proposal to which the methods of this section do not apply.<\/jats:p>","DOI":"10.2307\/2274232","type":"journal-article","created":{"date-parts":[[2006,5,6]],"date-time":"2006-05-06T22:13:30Z","timestamp":1146953610000},"page":"442-450","source":"Crossref","is-referenced-by-count":1,"title":["Axiomatic recursion theory and the continuous functionals"],"prefix":"10.1017","volume":"50","author":[{"given":"Simon","family":"Thompson","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"56","published-online":{"date-parts":[[2014,3,12]]},"reference":[{"key":"S0022481200032771_ref006","doi-asserted-by":"publisher","DOI":"10.1007\/978-94-010-1138-9_12"},{"key":"S0022481200032771_ref005","doi-asserted-by":"publisher","DOI":"10.1016\/S0049-237X(08)71119-4"},{"key":"S0022481200032771_ref008","doi-asserted-by":"publisher","DOI":"10.1016\/0003-4843(81)90014-0"},{"key":"S0022481200032771_ref007","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0098600"},{"key":"S0022481200032771_ref004","first-page":"135","volume-title":"Generalised recursion theory. II","author":"Hyland","year":"1978"},{"key":"S0022481200032771_ref001","first-page":"373","volume-title":"Logic Colloquium 76","author":"Feferman","year":"1977"},{"key":"S0022481200032771_ref003","first-page":"407","volume-title":"Logic Colloquium 76","author":"Gandy","year":"1977"},{"key":"S0022481200032771_ref002","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-11824-5"},{"key":"S0022481200032771_ref010","unstructured":"Thompson S. J. , Recursion theories on the continuous functionals, D. Phil. Thesis, University of Oxford, Oxford, 1984."},{"key":"S0022481200032771_ref009","doi-asserted-by":"publisher","DOI":"10.1016\/S0049-237X(08)71361-2"}],"container-title":["Journal of Symbolic Logic"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S0022481200032771","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,22]],"date-time":"2019-05-22T22:36:04Z","timestamp":1558564564000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S0022481200032771\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985,6]]},"references-count":10,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1985,6]]}},"alternative-id":["S0022481200032771"],"URL":"https:\/\/doi.org\/10.2307\/2274232","relation":{},"ISSN":["0022-4812","1943-5886"],"issn-type":[{"value":"0022-4812","type":"print"},{"value":"1943-5886","type":"electronic"}],"subject":[],"published":{"date-parts":[[1985,6]]}}}