{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,3,22]],"date-time":"2023-03-22T07:12:59Z","timestamp":1679469179900},"reference-count":4,"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":16301,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J. symb.\n                        log."],"published-print":{"date-parts":[[1969,7,25]]},"abstract":"<jats:p>If <jats:italic>A<\/jats:italic> and <jats:italic>B<\/jats:italic> are subsets of natural numbers\n                        we say that <jats:italic>A<\/jats:italic> is <jats:italic>recursively equivalent to\n                           B<\/jats:italic> (denoted <jats:italic>A<\/jats:italic> \u2243 <jats:italic>B<\/jats:italic>) if there is\n                        a one-one partial recursive function which maps <jats:italic>A<\/jats:italic> onto\n                           <jats:italic>B<\/jats:italic>, and that <jats:italic>A<\/jats:italic> is <jats:italic>recursively\n                           isomorphic to B<\/jats:italic> (denoted <jats:italic>A<\/jats:italic> \u2245\n                           <jats:italic>B)<\/jats:italic> if there is a one-one total recursive function which\n                        maps <jats:italic>A<\/jats:italic> onto <jats:italic>B<\/jats:italic> and <jats:italic>\u0100<\/jats:italic> (the\n                        complement of <jats:italic>A<\/jats:italic>) onto <jats:italic>B#x00AF;<\/jats:italic>.<\/jats:p>","DOI":"10.2307\/2271106","type":"journal-article","created":{"date-parts":[[2006,5,6]],"date-time":"2006-05-06T20:53:51Z","timestamp":1146948831000},"page":"285-289","source":"Crossref","is-referenced-by-count":4,"title":["Constructive order types on cuts"],"prefix":"10.1017","volume":"34","author":[{"given":"Robert I.","family":"Soare","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"56","published-online":{"date-parts":[[2014,3,12]]},"reference":[{"key":"S002248120009455X_ref004","unstructured":"Soare R. I. , Recursion theory and Dedekind cuts, Transactions of the American Mathematical Society (to appear)."},{"key":"S002248120009455X_ref001","volume-title":"Constructive order types","author":"Crossley"},{"key":"S002248120009455X_ref003","volume-title":"Theory of recursive functions and effective computability","author":"Rogers","year":"1967"},{"key":"S002248120009455X_ref002","first-page":"67","article-title":"Recursive equivalence types","volume":"3","author":"Dekker","year":"1960","journal-title":"University of California publications in mathematics (N.S.)"}],"container-title":["Journal of Symbolic Logic"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S002248120009455X","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,3,22]],"date-time":"2023-03-22T06:35:37Z","timestamp":1679466937000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S002248120009455X\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1969,7,25]]},"references-count":4,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1969,7,25]]}},"alternative-id":["S002248120009455X"],"URL":"https:\/\/doi.org\/10.2307\/2271106","relation":{},"ISSN":["0022-4812","1943-5886"],"issn-type":[{"value":"0022-4812","type":"print"},{"value":"1943-5886","type":"electronic"}],"subject":[],"published":{"date-parts":[[1969,7,25]]}}}