{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,6]],"date-time":"2026-04-06T08:44:38Z","timestamp":1775465078837,"version":"3.50.1"},"reference-count":9,"publisher":"Oxford University Press (OUP)","issue":"1","license":[{"start":{"date-parts":[[2021,7,23]],"date-time":"2021-07-23T00:00:00Z","timestamp":1626998400000},"content-version":"vor","delay-in-days":1,"URL":"https:\/\/academic.oup.com\/journals\/pages\/open_access\/funder_policies\/chorus\/standard_publication_model"}],"funder":[{"DOI":"10.13039\/100000001","name":"NSF","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"name":"NSF postdoctoral grant","award":["DMS-1600228"],"award-info":[{"award-number":["DMS-1600228"]}]},{"name":"AMS-Simons Foundation Collaboration","award":["626304"],"award-info":[{"award-number":["626304"]}]},{"name":"Nazarbayev University Faculty Development Competitive Research Grants","award":["N021220FD3851"],"award-info":[{"award-number":["N021220FD3851"]}]},{"name":"NSF postdoctoral grant","award":["DMS-1606455"],"award-info":[{"award-number":["DMS-1606455"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022,1,12]]},"abstract":"<jats:title>Abstract<\/jats:title>\n               <jats:p>We generalize the analysis of Andrews, Schweber and Sorbi of the first-order theory of the partial order of degrees of c.e. equivalence relations to higher computability theory, specifically to the setting of a regular cardinal.<\/jats:p>","DOI":"10.1093\/logcom\/exab045","type":"journal-article","created":{"date-parts":[[2021,7,2]],"date-time":"2021-07-02T20:16:18Z","timestamp":1625256978000},"page":"98-114","source":"Crossref","is-referenced-by-count":3,"title":["The first-order theory of the computably enumerable equivalence relations in the uncountable setting"],"prefix":"10.1093","volume":"32","author":[{"given":"Uri","family":"Andrews","sequence":"first","affiliation":[{"name":"Department of Mathematics, University of Wisconsin Madison , WI 53706-1325, USA"}]},{"given":"Steffen","family":"Lempp","sequence":"additional","affiliation":[{"name":"Department of Mathematics, University of Wisconsin Madison , WI 53706-1325, USA"}]},{"given":"Manat","family":"Mustafa","sequence":"additional","affiliation":[{"name":"Department of Mathematics, School of Science and Humanities , Nazarbayev University, 53 Kabanbay Batyr Ave,010000 Nur-Sultan, Kazakhstan"}]},{"given":"Noah D","family":"Schweber","sequence":"additional","affiliation":[{"name":"Department of Mathematics, University of Wisconsin Madison , WI 53706-1325, USA"}]}],"member":"286","published-online":{"date-parts":[[2021,7,22]]},"reference":[{"key":"2022072200085173700_ref1","doi-asserted-by":"crossref","first-page":"418","DOI":"10.1007\/978-3-319-50062-1_25","article-title":"A survey on universal computably enumerable equivalence relations","volume-title":"Computability and Complexity","author":"Andrews","year":"2017"},{"key":"2022072200085173700_ref2","doi-asserted-by":"crossref","article-title":"On the structure of computable reducibility on equivalence relations of natural numbers","author":"Andrews","DOI":"10.1017\/jsl.2022.28"},{"key":"2022072200085173700_ref3","doi-asserted-by":"crossref","first-page":"102811","DOI":"10.1016\/j.apal.2020.102811","article-title":"The theory of ceers computes true arithmetic","volume":"171","author":"Andrews","year":"2020","journal-title":"Annals of Pure and Applied Logic"},{"key":"2022072200085173700_ref4","doi-asserted-by":"crossref","first-page":"193","DOI":"10.3233\/COM-180098","article-title":"Joins and meets in the structure of ceers","volume":"8","author":"Andrews","year":"2019","journal-title":"Computability"},{"key":"2022072200085173700_ref5","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-11035-5","volume-title":"Admissible Sets and Structures: An Approach to Definability Theory","author":"Barwise","year":"1975"},{"key":"2022072200085173700_ref6","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1023\/A:1010521410739","article-title":"Computably enumerable equivalence relations","volume":"67","author":"Gao","year":"2001","journal-title":"Studia Logica"},{"key":"2022072200085173700_ref7","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-12898-5","volume-title":"Recursion-Theoretic Hierarchies","author":"Hinman","year":"1978"},{"key":"2022072200085173700_ref8","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-12013-2","article-title":"Perspectives in Mathematical Logic","volume-title":"Higher Recursion Theory","author":"Sacks","year":"1990"},{"key":"2022072200085173700_ref9","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/0003-4843(79)90016-0","article-title":"Finite injury arguments in infinite computation theories","volume":"16","author":"Stoltenberg-Hansen","year":"1979","journal-title":"Annals of Mathematical Logic"}],"container-title":["Journal of Logic and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/academic.oup.com\/logcom\/article-pdf\/32\/1\/98\/42180349\/exab045.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/academic.oup.com\/logcom\/article-pdf\/32\/1\/98\/42180349\/exab045.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,22]],"date-time":"2022-07-22T00:09:25Z","timestamp":1658448565000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/logcom\/article\/32\/1\/98\/6325734"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,7,22]]},"references-count":9,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2021,7,22]]},"published-print":{"date-parts":[[2022,1,12]]}},"URL":"https:\/\/doi.org\/10.1093\/logcom\/exab045","relation":{},"ISSN":["0955-792X","1465-363X"],"issn-type":[{"value":"0955-792X","type":"print"},{"value":"1465-363X","type":"electronic"}],"subject":[],"published-other":{"date-parts":[[2022,1]]},"published":{"date-parts":[[2021,7,22]]}}}