{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:12:40Z","timestamp":1725664360118},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540581406"},{"type":"electronic","value":"9783540484424"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1994]]},"DOI":"10.1007\/3-540-58140-5_14","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T15:19:08Z","timestamp":1330269548000},"page":"140-141","source":"Crossref","is-referenced-by-count":1,"title":["Classes with pairwise equivalent enumerations"],"prefix":"10.1007","author":[{"given":"S. S.","family":"Goncharov","sequence":"first","affiliation":[]},{"given":"S. A.","family":"Badaev","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,7]]},"reference":[{"issue":"3","key":"14_CR1","doi-asserted-by":"crossref","first-page":"331","DOI":"10.2307\/2964292","volume":"23","author":"H. Rogers Jr.","year":"1958","unstructured":"Rogers, H. jr. G\u00f6del numberings of partial recursive functions. J. Symb. Logic, v.23, n.3(1958), 331\u2013341.","journal-title":"J. Symb. Logic"},{"issue":"2","key":"14_CR2","first-page":"252","volume":"15","author":"M. B. Pour-El","year":"1964","unstructured":"Pour-El, M. B. G\u00f6del numberings versus Friedberg numberings. Proc. Amer. Math. Soc., v.15, n.2(1964), 252\u2013255.","journal-title":"Proc. Amer. Math. Soc."},{"issue":"5","key":"14_CR3","first-page":"1015","volume":"8","author":"Y. L. Ershov","year":"1967","unstructured":"Ershov, Yu. L. Numerations of families of general recursive functions. Sibirsk. Matem. Zhurn., v.8, n.5(1967), 1015\u20131025 (Russian).","journal-title":"Sibirsk. Matem. Zhurn."},{"key":"14_CR4","volume-title":"The theory of numberings","author":"Y. L. Ershov","year":"1977","unstructured":"Ershov, Yu. L. The theory of numberings. Nauka, Moscow, 1977 (Russian)."},{"key":"14_CR5","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1007\/978-94-010-1138-9_11","volume-title":"Computable numberings. Logic, Foundations of Mathematics and Computability Theory","author":"I. A. Lavrov","year":"1977","unstructured":"Lavrov, I. A. Computable numberings. Logic, Foundations of Mathematics and Computability Theory, pp.195\u2013206, D. Reidel Publishing Company, Dordrecht-Holland, 1977."},{"key":"14_CR6","first-page":"75","volume":"6","author":"A. I. Mal'cev","year":"1965","unstructured":"Mal'cev, A. I. Positive and negative enumerations. Soviet Math. Dokl., v.6(1965), 75\u201377.","journal-title":"Soviet Math. Dokl."},{"issue":"5","key":"14_CR7","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1007\/BF02218587","volume":"12","author":"V. V. V'jugin","year":"1973","unstructured":"V'jugin, V. V. Certain examples of upper semilattice of computable numerations. Algebra and Logic, v.12, n.5(1973), 287\u2013296.","journal-title":"Algebra and Logic"},{"key":"14_CR8","doi-asserted-by":"crossref","first-page":"128","DOI":"10.1007\/BF01877237","volume":"15","author":"V. L. Selivanov","year":"1976","unstructured":"Selivanov. V. L. The numerations of families of general recursive functions. Algebra and Logic, v.15(1976), 128\u2013141.","journal-title":"Algebra and Logic"},{"issue":"2","key":"14_CR9","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1007\/BF01668593","volume":"16","author":"S. A. Badaev","year":"1977","unstructured":"Badaev, S. A. On computable enumerations of the families of total recursive functions. Algebra and Logic, v.16, n.2(1977), 83\u201398.","journal-title":"Algebra and Logic"},{"issue":"2","key":"14_CR10","first-page":"142","volume":"332","author":"S. S. Goncharov","year":"1993","unstructured":"Goncharov, S. S. Positive computable enumerations. Doklady Akademii Nauk (of Russia), v.332, n.2(1993), 142\u2013143 (Russian).","journal-title":"Doklady Akademii Nauk (of Russia)"}],"container-title":["Lecture Notes in Computer Science","Logical Foundations of Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-58140-5_14.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T01:11:33Z","timestamp":1619572293000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-58140-5_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540581406","9783540484424"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/3-540-58140-5_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1994]]}}}