{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T20:58:24Z","timestamp":1648587504130},"reference-count":7,"publisher":"Cambridge University Press (CUP)","issue":"4","license":[{"start":{"date-parts":[[2014,3,12]],"date-time":"2014-03-12T00:00:00Z","timestamp":1394582400000},"content-version":"unspecified","delay-in-days":7406,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J. symb. log."],"published-print":{"date-parts":[[1993,12]]},"abstract":"<jats:p>The study of recursion categories was introduced in [DH] to carry out an algebraic and intrinsic investigation of structures and phenomena which arise in the classical recursion theory. In this paper a recursion categorical arrangement is proposed for some of the concepts of reduction and relativization which are commonplace in studying classical recursive functions and operators. Indeed, this introduction can be done in a natural way, using categorical concepts already defined, without resorting to special structures. In developing the subject outlined one also has the opportunity of discussing the concept of uniform proof in the context of the recursion categories.<\/jats:p>","DOI":"10.2307\/2275141","type":"journal-article","created":{"date-parts":[[2006,5,6]],"date-time":"2006-05-06T22:50:13Z","timestamp":1146955813000},"page":"1251-1267","source":"Crossref","is-referenced-by-count":1,"title":["A relativization mechanism in recursion categories"],"prefix":"10.1017","volume":"58","author":[{"given":"Stefano","family":"Stefani","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"56","published-online":{"date-parts":[[2014,3,12]]},"reference":[{"key":"S0022481200020570_ref003","first-page":"1023","volume":"54","author":"Montagna","year":"1989","journal-title":"Creativeness and completeness in categories of partial recursive operators"},{"key":"S0022481200020570_ref006","unstructured":"Rosolini G. , Continuity and effectiveness in topoi, Ph.D. thesis, Oxford University, Oxford, 1986."},{"key":"S0022481200020570_ref002","first-page":"1252","volume":"55","author":"Heller","year":"1990","journal-title":"An existence theorem for recursion categories"},{"key":"S0022481200020570_ref001","first-page":"594","volume":"52","author":"Di Paola","year":"1987","journal-title":"Dominical categories: recursion theory without elements"},{"key":"S0022481200020570_ref005","volume-title":"Theory of recursive function and effective computability","author":"Rogers","year":"1967"},{"key":"S0022481200020570_ref007","doi-asserted-by":"publisher","DOI":"10.4064\/fm-138-1-1-12"},{"key":"S0022481200020570_ref004","first-page":"501","article-title":"Degrees of difficulty of the mass problems","volume":"104","author":"Medvedev","year":"1955","journal-title":"Doklady Akademii Nauk SSSR"}],"container-title":["Journal of Symbolic Logic"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S0022481200020570","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,15]],"date-time":"2019-05-15T21:03:38Z","timestamp":1557954218000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S0022481200020570\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,12]]},"references-count":7,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1993,12]]}},"alternative-id":["S0022481200020570"],"URL":"https:\/\/doi.org\/10.2307\/2275141","relation":{},"ISSN":["0022-4812","1943-5886"],"issn-type":[{"value":"0022-4812","type":"print"},{"value":"1943-5886","type":"electronic"}],"subject":[],"published":{"date-parts":[[1993,12]]}}}