{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,30]],"date-time":"2026-04-30T02:39:50Z","timestamp":1777516790139,"version":"3.51.4"},"reference-count":28,"publisher":"SAGE Publications","issue":"3-4","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["COM"],"published-print":{"date-parts":[[2019,9,20]]},"DOI":"10.3233\/com-180098","type":"journal-article","created":{"date-parts":[[2018,7,3]],"date-time":"2018-07-03T14:54:13Z","timestamp":1530629653000},"page":"193-241","source":"Crossref","is-referenced-by-count":42,"title":["Joins and meets in the structure of ceers"],"prefix":"10.1177","volume":"8","author":[{"given":"Uri","family":"Andrews","sequence":"first","affiliation":[{"name":"Department of Mathematics,University of Wisconsin, WI, USA. andrews@math.wisc.edu"}]},{"given":"Andea","family":"Sorbi","sequence":"additional","affiliation":[{"name":"Department of Information Engineering and Mathematics,University of Siena, 53100 Siena, Italy. andrea.sorbi@unisi.it"}]}],"member":"179","reference":[{"key":"10.3233\/COM-180098_ref1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-50062-1_25"},{"issue":"1","key":"10.3233\/COM-180098_ref2","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1017\/jsl.2013.8","article-title":"Universal computably enumerable equivalence relations","volume":"79","author":"Andrews","year":"2014","journal-title":"J. Symbolic Logic"},{"key":"10.3233\/COM-180098_ref3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1017\/jsl.2016.26","article-title":"The complexity of index sets of classes of computably enumerable equivalence relations","volume":"81","author":"Andrews","year":"2016","journal-title":"J. Symbolic Logic"},{"key":"10.3233\/COM-180098_ref4","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1016\/j.apal.2017.12.001","article-title":"Jumps of computably enumerable equivalence relations","volume":"169","author":"Andrews","year":"2018","journal-title":"Ann. Pure Appl. Logic"},{"issue":"1\u20132","key":"10.3233\/COM-180098_ref5","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1002\/malq.201500057","article-title":"Weakly precomplete computably enumerable equivalence relations","volume":"62","author":"Badaev","year":"2016","journal-title":"Mat. Log. Quart."},{"key":"10.3233\/COM-180098_ref6","doi-asserted-by":"crossref","unstructured":"H.\u00a0Becker and A.S.\u00a0Kechris, The Descriptive Set Theory of Polish Group Actions, London Mathematical Society Lecture Notes Series, Vol.\u00a0232, Cambridge University Press, Cambridge, 1996.","DOI":"10.1017\/CBO9780511735264"},{"issue":"3","key":"10.3233\/COM-180098_ref7","doi-asserted-by":"publisher","first-page":"529","DOI":"10.2307\/2273443","article-title":"Classifying positive equivalence relations","volume":"48","author":"Bernardi","year":"1983","journal-title":"J. Symbolic Logic"},{"key":"10.3233\/COM-180098_ref8","doi-asserted-by":"crossref","first-page":"15","DOI":"10.3233\/COM-2012-004","article-title":"The hierarchy of equivalence relations on the natural numbers","volume":"1","author":"Coskey","year":"2012","journal-title":"Computability"},{"issue":"6","key":"10.3233\/COM-180098_ref9","doi-asserted-by":"publisher","first-page":"378","DOI":"10.1007\/BF02218645","article-title":"Positive equivalences","volume":"10","author":"Ershov","year":"1973","journal-title":"Algebra and Logic"},{"key":"10.3233\/COM-180098_ref10","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1002\/malq.19730191901","article-title":"Theorie der Numerierungen I","volume":"19","author":"Ershov","year":"1973","journal-title":"Z. Math. Logik Grundlag. Math."},{"issue":"1","key":"10.3233\/COM-180098_ref11","doi-asserted-by":"publisher","first-page":"122","DOI":"10.2178\/jsl\/1327068695","article-title":"Isomorphism relations on computable structures","volume":"77","author":"Fokina","year":"2012","journal-title":"J. Symbolic Logic"},{"issue":"2","key":"10.3233\/COM-180098_ref13","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1017\/jsl.2015.11","article-title":"Linear orders realized by c.e. equivalence relations","volume":"81","author":"Fokina","year":"2016","journal-title":"J. Symbolic Logic"},{"key":"10.3233\/COM-180098_ref14","doi-asserted-by":"crossref","unstructured":"S.\u00a0Gao, in: Invariant Descriptive Set Theory, Pure and Applied Mathematics, CRC Press, Boca Raton, FL, 2009.","DOI":"10.1201\/9781584887942"},{"key":"10.3233\/COM-180098_ref15","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1023\/A:1010521410739","article-title":"Computably enumerable equivalence relations","volume":"67","author":"Gao","year":"2001","journal-title":"Studia Logica"},{"issue":"7\u20138","key":"10.3233\/COM-180098_ref16","doi-asserted-by":"publisher","first-page":"1263","DOI":"10.1016\/j.apal.2014.04.001","article-title":"Graphs realised by r.e. equivalence relations","volume":"165","author":"Gavryushkin","year":"2014","journal-title":"Ann. Pure Appl. Logic"},{"issue":"25","key":"10.3233\/COM-180098_ref17","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1016\/j.tcs.2015.11.042","article-title":"Reducibilities among equivalence relations induced by recursively enumerable structures","volume":"612","author":"Gavryushkin","year":"2016","journal-title":"Theoret. Comput. Sci."},{"issue":"3","key":"10.3233\/COM-180098_ref18","doi-asserted-by":"publisher","first-page":"859","DOI":"10.1017\/jsl.2013.33","article-title":"Complexity of equivalence relations and preorders from computability theory","volume":"79","author":"Ianovski","year":"2014","journal-title":"J. Symbolic Logic"},{"key":"10.3233\/COM-180098_ref19","doi-asserted-by":"publisher","first-page":"351","DOI":"10.2140\/pjm.1969.29.351","article-title":"Initial segments of one\u2013one degrees","volume":"29","author":"Lachlan","year":"1969","journal-title":"Pacific J. Math."},{"key":"10.3233\/COM-180098_ref20","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1002\/malq.19870330106","article-title":"A note on positive equivalence relations","volume":"33","author":"Lachlan","year":"1987","journal-title":"Z. Math. Logik Grundlag. Math."},{"issue":"4","key":"10.3233\/COM-180098_ref21","first-page":"5","article-title":"Constructive algebras, I","volume":"3","author":"Mal\u2019tsev","year":"1961","journal-title":"Uspekhi Mat. Nauk"},{"key":"10.3233\/COM-180098_ref22","unstructured":"A.I.\u00a0Mal\u2019tsev, The Metamathematics of Algebraic Systems, North-Holland, Amsterdam, 1971."},{"key":"10.3233\/COM-180098_ref23","unstructured":"C.F.\u00a0Miller III., On Group-Theoretic Decision Problems and Their Classification, Annals of Mathematics Studies, Princeton University Press, Princeton, NJ, 1971."},{"key":"10.3233\/COM-180098_ref24","first-page":"419","article-title":"Relative precomplete numerations and arithmetic","volume":"11","author":"Montagna","year":"1982","journal-title":"J. Philosphical Logic"},{"key":"10.3233\/COM-180098_ref25","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1017\/S0960129516000335","article-title":"Calibrating word problems of groups via the complexity of equivalence relations","volume":"28","author":"Nies","year":"2018","journal-title":"Math. Structures Comput. Sci."},{"issue":"1","key":"10.3233\/COM-180098_ref26","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1090\/S0273-0979-1981-14863-1","article-title":"Strong reducibilities","volume":"4","author":"Odifreddi","year":"1981","journal-title":"Bull. Amer. Math. Soc."},{"key":"10.3233\/COM-180098_ref27","unstructured":"H.\u00a0Rogers Jr., Theory of Recursive Functions and Effective Computability, McGraw-Hill, New York, 1967."},{"key":"10.3233\/COM-180098_ref28","doi-asserted-by":"crossref","unstructured":"R.I.\u00a0Soare, Recursively Enumerable Sets and Degrees, Perspectives in Mathematical Logic, Omega Series, Springer-Verlag, Heidelberg, 1987.","DOI":"10.1007\/978-3-662-02460-7"},{"key":"10.3233\/COM-180098_ref29","unstructured":"A.\u00a0Visser, Numerations, \u03bb-calculus & arithmetic, in: To H. B. Curry: Essays on Combinatory Logic, Lambda Calculus and Formalism, J.P.\u00a0Seldin and J.R.\u00a0Hindley, eds, Academic Press, London, 1980, pp.\u00a0259\u2013284."}],"container-title":["Computability"],"original-title":[],"link":[{"URL":"https:\/\/content.iospress.com\/download?id=10.3233\/COM-180098","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,28]],"date-time":"2026-04-28T16:00:02Z","timestamp":1777392002000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/full\/10.3233\/COM-180098"}},"subtitle":[],"editor":[{"given":"Vasco","family":"Brattka","sequence":"additional","affiliation":[]},{"given":"Rod","family":"Downey","sequence":"additional","affiliation":[]},{"given":"Julia F.","family":"Knight","sequence":"additional","affiliation":[]},{"given":"Steffen","family":"Lempp","sequence":"additional","affiliation":[]}],"short-title":[],"issued":{"date-parts":[[2019,9,20]]},"references-count":28,"journal-issue":{"issue":"3-4"},"URL":"https:\/\/doi.org\/10.3233\/com-180098","relation":{},"ISSN":["2211-3576","2211-3568"],"issn-type":[{"value":"2211-3576","type":"electronic"},{"value":"2211-3568","type":"print"}],"subject":[],"published":{"date-parts":[[2019,9,20]]}}}