{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,27]],"date-time":"2026-03-27T05:20:58Z","timestamp":1774588858239,"version":"3.50.1"},"reference-count":7,"publisher":"Cambridge University Press (CUP)","issue":"1","license":[{"start":{"date-parts":[[2014,3,12]],"date-time":"2014-03-12T00:00:00Z","timestamp":1394582400000},"content-version":"unspecified","delay-in-days":2568,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J. symb. log."],"published-print":{"date-parts":[[2007,3]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>It is proved that the (2<jats:sub><jats:italic>p<\/jats:italic><\/jats:sub>)-c. e. e-degrees are not elementarily equivalent to the (2<jats:sub><jats:italic>p<\/jats:italic><\/jats:sub> + 1)-c. e. e-degrees for each nonzero <jats:italic>p<\/jats:italic> \u2208 \u03c9. It follows that <jats:italic>m<\/jats:italic>-c. e. e-degrees are not elementarily equivalent to the <jats:italic>n<\/jats:italic>-c e. e-degrees if 1 &lt;<jats:italic>m<\/jats:italic> &lt; <jats:italic>n<\/jats:italic>.<\/jats:p>","DOI":"10.2178\/jsl\/1174668395","type":"journal-article","created":{"date-parts":[[2007,12,19]],"date-time":"2007-12-19T11:24:33Z","timestamp":1198063473000},"page":"277-284","source":"Crossref","is-referenced-by-count":2,"title":["Elementary differences between the (2<sub><i>p<\/i><\/sub>)-C. E. and the (2<sub><i>p<\/i><\/sub> +1)-c. e. enumeration degrees"],"prefix":"10.1017","volume":"72","author":[{"given":"I. S.","family":"Kalimullin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"56","published-online":{"date-parts":[[2014,3,12]]},"reference":[{"key":"S0022481200005594_ref007","volume-title":"Perspectives in Mathematical Logic","author":"Soare","year":"1987"},{"key":"S0022481200005594_ref006","volume-title":"Theory of Recursive Functions and Effective Computability","author":"Rogers","year":"1967"},{"key":"S0022481200005594_ref004","doi-asserted-by":"publisher","DOI":"10.1142\/S0219061303000285"},{"key":"S0022481200005594_ref003","first-page":"537\u2013546","volume":"67","author":"Kalimullin","year":"2002","journal-title":"Splitting properties of n-c. e. enumeration degrees"},{"key":"S0022481200005594_ref002","first-page":"22\u201325","article-title":"Elementary theories of semilattices of n-recursive enumerable degrees with respect to enumerability","volume":"45","author":"Kalimullin","year":"2001","journal-title":"Russian Mathematics"},{"key":"S0022481200005594_ref005","first-page":"537\u2013569","article-title":"Lower bounds for pairs of recursively enumerable degrees","volume":"16","author":"Lachlan","year":"1966","journal-title":"Proceedings of the London Mathematical Society"},{"key":"S0022481200005594_ref001","first-page":"57\u2013110","volume-title":"Recursion Theory Week, Oberwolfach 1989","volume":"1432","author":"Cooper","year":"1990"}],"container-title":["Journal of Symbolic Logic"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S0022481200005594","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T20:10:45Z","timestamp":1556741445000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S0022481200005594\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,3]]},"references-count":7,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2007,3]]}},"alternative-id":["S0022481200005594"],"URL":"https:\/\/doi.org\/10.2178\/jsl\/1174668395","relation":{},"ISSN":["0022-4812","1943-5886"],"issn-type":[{"value":"0022-4812","type":"print"},{"value":"1943-5886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,3]]}}}