{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,8,31]],"date-time":"2023-08-31T17:41:39Z","timestamp":1693503699442},"reference-count":21,"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":2293,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J. symb. log."],"published-print":{"date-parts":[[2007,12]]},"abstract":"Abstract<\/jats:title>This paper calculates, in a precise way. the complexity of the index sets for three classes of computable structures: the class of structures of Scott rank , the class , of structures of Scott rank , and the class K<\/jats:italic> of all structures of non-computable Scott rank. We show that I(K)<\/jats:italic> is m<\/jats:italic>-complete is m<\/jats:italic>-complete relative to Kleene's and is m<\/jats:italic>-complete relative to .<\/jats:p>","DOI":"10.2178\/jsl\/1203350796","type":"journal-article","created":{"date-parts":[[2008,3,25]],"date-time":"2008-03-25T18:42:11Z","timestamp":1206470531000},"page":"1418-1432","source":"Crossref","is-referenced-by-count":9,"title":["Index sets for classes of high rank structures"],"prefix":"10.1017","volume":"72","author":[{"given":"W.","family":"Calvert","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"E.","family":"Fokina","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S. S.","family":"Goncharov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J. F.","family":"Knight","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"O.","family":"Kudinov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A. S.","family":"Morozov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"V.","family":"Puzarenko","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"56","published-online":{"date-parts":[[2014,3,12]]},"reference":[{"key":"S0022481200005016_ref020","unstructured":"White W. , Characterizations for computable structures, PhD dissertation, Cornell University, 2000."},{"key":"S0022481200005016_ref017","volume-title":"Theory of recursive functions and effective comput ability","author":"Rogers","year":"1967"},{"key":"S0022481200005016_ref015","unstructured":"Millar J. and Sacks G. , Atomic models higher up, preprint."},{"key":"S0022481200005016_ref014","first-page":"301","volume":"46","author":"Makkai","year":"1981","journal-title":"An example concerning Scott heights"},{"key":"S0022481200005016_ref012","unstructured":"Knight J. F. , A computable structure of Scott rank whose computable infinitary theory is not \u21350 categorical, in preparation."},{"key":"S0022481200005016_ref011","volume-title":"Model theory for infinitary logic","author":"Keisler","year":"1971"},{"key":"S0022481200005016_ref010","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9947-1968-0244049-7"},{"key":"S0022481200005016_ref008","first-page":"585","volume":"69","author":"Goncharov","year":"2004","journal-title":"relations and paths through"},{"key":"S0022481200005016_ref007","first-page":"283","volume":"71","author":"Calvert","year":"2006","journal-title":"Trees of Scott rank and computable approximability"},{"key":"S0022481200005016_ref006","doi-asserted-by":"publisher","DOI":"10.1007\/s10469-006-0029-0"},{"key":"S0022481200005016_ref004","unstructured":"Calvert W. , Goncharov S. S. , and Knight J. F. , Boolean algebras of Scott rank , preprint."},{"key":"S0022481200005016_ref002","volume-title":"Computable structures and the hyperarithmetical hierarchy","author":"Ash","year":"2000"},{"key":"S0022481200005016_ref016","doi-asserted-by":"publisher","DOI":"10.1016\/0003-4843(74)90017-5"},{"key":"S0022481200005016_ref021","doi-asserted-by":"publisher","DOI":"10.1002\/malq.200310066"},{"key":"S0022481200005016_ref019","first-page":"329","volume-title":"The theory of models","author":"Scott","year":"1965"},{"key":"S0022481200005016_ref018","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-12013-2"},{"key":"S0022481200005016_ref005","volume-title":"Proceedings of the North Texas Logic Conference, October, 2004","author":"Calvert"},{"key":"S0022481200005016_ref001","doi-asserted-by":"publisher","DOI":"10.1016\/0168-0072(90)90004-L"},{"key":"S0022481200005016_ref013","article-title":"Computable structures of rank","author":"Knight","journal-title":"Journal of Mathematical Logic"},{"key":"S0022481200005016_ref003","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-11035-5"},{"key":"S0022481200005016_ref009","doi-asserted-by":"publisher","DOI":"10.1023\/A:1021758312697"}],"container-title":["Journal of Symbolic Logic"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S0022481200005016","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T19:42:55Z","timestamp":1556739775000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S0022481200005016\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,12]]},"references-count":21,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2007,12]]}},"alternative-id":["S0022481200005016"],"URL":"https:\/\/doi.org\/10.2178\/jsl\/1203350796","relation":{},"ISSN":["0022-4812","1943-5886"],"issn-type":[{"value":"0022-4812","type":"print"},{"value":"1943-5886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,12]]}}}