{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,9]],"date-time":"2026-07-09T11:58:31Z","timestamp":1783598311415,"version":"3.55.0"},"reference-count":10,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2001,2,1]],"date-time":"2001-02-01T00:00:00Z","timestamp":980985600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2001,2,1]],"date-time":"2001-02-01T00:00:00Z","timestamp":980985600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Studia Logica"],"published-print":{"date-parts":[[2001,2]]},"DOI":"10.1023\/a:1010521410739","type":"journal-article","created":{"date-parts":[[2002,12,23]],"date-time":"2002-12-23T12:42:08Z","timestamp":1040647328000},"page":"27-59","source":"Crossref","is-referenced-by-count":56,"title":["Computably Enumerable Equivalence Relations"],"prefix":"10.1007","volume":"67","author":[{"given":"Su","family":"Gao","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Peter","family":"Gerdes","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"350852_CR1","doi-asserted-by":"crossref","unstructured":"Becker, H., and A. S. Kechris, The Descriptive Set Theory of Polish Group Actions, London Mathematical Society Lecture Note Serious 232, Cambridge University Press, 1996.","DOI":"10.1017\/CBO9780511735264"},{"key":"350852_CR2","doi-asserted-by":"crossref","first-page":"529","DOI":"10.2307\/2273443","volume":"48","author":"C. Bernardi","year":"1983","unstructured":"Bernardi, C., and A. Sorbi, 'Classifying positive equivalence relations', J.Sym bolic Logic 48 (1983), 529-538.","journal-title":"J.Sym bolic Logic"},{"key":"350852_CR3","doi-asserted-by":"crossref","first-page":"378","DOI":"10.1007\/BF02218645","volume":"10","author":"Y. L. Ershov","year":"1973","unstructured":"Ershov, Yu. L., 'Positive equivalence relations' (English translation), Algebra and Logic 10 (1973), 378-394.","journal-title":"Algebra and Logic"},{"key":"350852_CR4","doi-asserted-by":"crossref","first-page":"894","DOI":"10.2307\/2274750","volume":"54","author":"H. Friedman","year":"1989","unstructured":"Friedman, H., and L. Stanley, 'A Borel reducibility theory for classes of countable structures', J.Sym bolic Logic 54 (1989), 894-914.","journal-title":"J.Sym bolic Logic"},{"key":"350852_CR5","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1002\/malq.19870330106","volume":"33","author":"A.H. Lachlan","year":"1987","unstructured":"Lachlan, A.H., 'A note on positive equivalence relations', Zeitschr. f. math. Logik und Grundlagen d. Math. 33 (1987), 43-46.","journal-title":"Zeitschr. f. math. Logik und Grundlagen d. Math"},{"key":"350852_CR6","series-title":"Annals of Mathematics Studies","volume-title":"On Group-theoretic Decision Problems and Their Classification","author":"C.F. Miller III","year":"1971","unstructured":"Miller, C.F., III, On Group-theoretic Decision Problems and Their Classification, Annals of Mathematics Studies, No. 68, Princeton University Press, Princeton, N. J.; University of Tokyo Press, Tokyo, 1971."},{"key":"350852_CR7","doi-asserted-by":"crossref","first-page":"490","DOI":"10.1002\/malq.19940400407","volume":"40","author":"A. Nies","year":"1994","unstructured":"Nies, A., 'Computably enumerable equivalence relations modulo finite differences', Math. Log. Quart. 40 (1994), 490-518.","journal-title":"Math. Log. Quart."},{"key":"350852_CR8","doi-asserted-by":"crossref","first-page":"172","DOI":"10.2307\/1969933","volume":"67","author":"M.O. Rabin","year":"1958","unstructured":"Rabin, M.O., 'Computable unsolvability of group theoretic problems', Ann. Math. 67 (1958), 172-194.","journal-title":"Ann. Math."},{"key":"350852_CR9","unstructured":"Rogers, H., Theory of Computable Functions and Effective Computability, MIT Press, 1987."},{"key":"350852_CR10","first-page":"259","volume-title":"To H.B. Curry: Essays on Combinatory Logic, Lambda Calculus and Formalism","author":"A. Visser","year":"1980","unstructured":"Visser, A., 'Numerations, lambda-calculus and arithmetic', in To H.B. Curry: Essays on Combinatory Logic, Lambda Calculus and Formalism (J.P. Seldin and J.R. Hindley, eds.), Academic Press, New York, 1980, 259-284."}],"container-title":["Studia Logica"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1010521410739.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1010521410739\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1010521410739.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,8]],"date-time":"2025-08-08T05:19:28Z","timestamp":1754630368000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1010521410739"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,2]]},"references-count":10,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2001,2]]}},"alternative-id":["350852"],"URL":"https:\/\/doi.org\/10.1023\/a:1010521410739","relation":{},"ISSN":["0039-3215","1572-8730"],"issn-type":[{"value":"0039-3215","type":"print"},{"value":"1572-8730","type":"electronic"}],"subject":[],"published":{"date-parts":[[2001,2]]}}}