{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T22:11:26Z","timestamp":1743027086072,"version":"3.40.3"},"publisher-location":"Cham","reference-count":36,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030229955"},{"type":"electronic","value":"9783030229962"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-22996-2_9","type":"book-chapter","created":{"date-parts":[[2019,7,3]],"date-time":"2019-07-03T23:02:56Z","timestamp":1562194976000},"page":"96-107","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Bounded Reducibility for Computable Numberings"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5834-2770","authenticated-orcid":false,"given":"Nikolay","family":"Bazhenov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8259-4441","authenticated-orcid":false,"given":"Manat","family":"Mustafa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9912-6364","authenticated-orcid":false,"given":"Sergei","family":"Ospichev","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,6,19]]},"reference":[{"issue":"18","key":"9_CR1","doi-asserted-by":"publisher","first-page":"1652","DOI":"10.1016\/j.tcs.2010.12.041","volume":"412","author":"K Ambos-Spies","year":"2011","unstructured":"Ambos-Spies, K., Badaev, S., Goncharov, S.: Inductive inference and computable numberings. Theor. Comput. Sci. 412(18), 1652\u20131668 (2011). https:\/\/doi.org\/10.1016\/j.tcs.2010.12.041","journal-title":"Theor. Comput. Sci."},{"key":"9_CR2","doi-asserted-by":"publisher","unstructured":"Andrews, U., Sorbi, A.: Joins and meets in the structure of ceers. Computability (2018). https:\/\/doi.org\/10.3233\/COM-180098, published online","DOI":"10.3233\/COM-180098"},{"key":"9_CR3","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/978-0-387-68546-5_2","volume-title":"New Computational Paradigms","author":"S Badaev","year":"2008","unstructured":"Badaev, S., Goncharov, S.: Computability and numberings. In: Cooper, S.B., L\u00f6we, B., Sorbi, A. (eds.) New Computational Paradigms, pp. 19\u201334. Springer, New York (2008). https:\/\/doi.org\/10.1007\/978-0-387-68546-5_2"},{"issue":"2","key":"9_CR4","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1007\/BF01668593","volume":"16","author":"SA Badaev","year":"1977","unstructured":"Badaev, S.A.: Computable enumerations of families of general recursive functions. Algebra Logic 16(2), 83\u201398 (1977). https:\/\/doi.org\/10.1007\/BF01668593","journal-title":"Algebra Logic"},{"issue":"3","key":"9_CR5","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1007\/BF00750228","volume":"33","author":"SA Badaev","year":"1994","unstructured":"Badaev, S.A.: Minimal numerations of positively computable families. Algebra Logic 33(3), 131\u2013141 (1994). https:\/\/doi.org\/10.1007\/BF00750228","journal-title":"Algebra Logic"},{"key":"9_CR6","doi-asserted-by":"publisher","unstructured":"Badaev, S.A., Goncharov, S.S.: Theory of numberings: open problems. In: Cholak, P., Lempp, S., Lerman, M., Shore, R. (eds.) Computability Theory and Its Applications. Contemporary Mathematics, vol. 257, pp. 23\u201338. American Mathematical Society, Providence (2000). https:\/\/doi.org\/10.1090\/conm\/257\/04025","DOI":"10.1090\/conm\/257\/04025"},{"issue":"2","key":"9_CR7","doi-asserted-by":"publisher","first-page":"618","DOI":"10.2178\/jsl\/1243948330","volume":"74","author":"SA Badaev","year":"2009","unstructured":"Badaev, S.A., Lempp, S.: A decomposition of the Rogers semilattice of a family of D.C.E. sets. J. Symb. Logic 74(2), 618\u2013640 (2009). https:\/\/doi.org\/10.2178\/jsl\/1243948330","journal-title":"J. Symb. Logic"},{"key":"9_CR8","doi-asserted-by":"publisher","unstructured":"Bazhenov, N., Mustafa, M., Yamaleev, M.: Elementary theories and hereditary undecidability for semilattices of numberings. Arch. Math. Logic (2018). https:\/\/doi.org\/10.1007\/s00153-018-0647-y, published online","DOI":"10.1007\/s00153-018-0647-y"},{"key":"9_CR9","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1016\/j.tcs.2018.04.036","volume":"733","author":"J Case","year":"2018","unstructured":"Case, J., Jain, S., Stephan, F.: Effectivity questions for Kleene\u2019s recursion theorem. Theor. Comput. Sci. 733, 55\u201370 (2018). https:\/\/doi.org\/10.1016\/j.tcs.2018.04.036","journal-title":"Theor. Comput. Sci."},{"issue":"5","key":"9_CR10","doi-asserted-by":"publisher","first-page":"771","DOI":"10.1007\/BF01040653","volume":"8","author":"YL Ershov","year":"1967","unstructured":"Ershov, Y.L.: Enumeration of families of general recursive functions. Sib. Math. J. 8(5), 771\u2013778 (1967). https:\/\/doi.org\/10.1007\/BF01040653","journal-title":"Sib. Math. J."},{"issue":"5","key":"9_CR11","doi-asserted-by":"publisher","first-page":"330","DOI":"10.1007\/BF02219286","volume":"7","author":"YL Ershov","year":"1968","unstructured":"Ershov, Y.L.: On computable enumerations. Algebra Logic 7(5), 330\u2013346 (1968). https:\/\/doi.org\/10.1007\/BF02219286","journal-title":"Algebra Logic"},{"key":"9_CR12","volume-title":"Theory of Numberings","author":"YL Ershov","year":"1977","unstructured":"Ershov, Y.L.: Theory of Numberings. Nauka, Moscow (1977). (in Russian)"},{"key":"9_CR13","doi-asserted-by":"publisher","unstructured":"Ershov, Y.L.: Theory of numberings. In: Griffor, E.R. (ed.) Handbook of Computability Theory. Studies in Logic and the Foundations of Mathematics, vol. 140, pp. 473\u2013503. North-Holland, Amsterdam (1999). https:\/\/doi.org\/10.1016\/S0049-237X(99)80030-5","DOI":"10.1016\/S0049-237X(99)80030-5"},{"issue":"3","key":"9_CR14","doi-asserted-by":"publisher","first-page":"309","DOI":"10.2307\/2964290","volume":"23","author":"RM Friedberg","year":"1958","unstructured":"Friedberg, R.M.: Three theorems on recursive enumeration. I. Decomposition. II. Maximal set. III. Enumeration without duplication. J. Symb. Logic 23(3), 309\u2013316 (1958). https:\/\/doi.org\/10.2307\/2964290","journal-title":"J. Symb. Logic"},{"issue":"3","key":"9_CR15","doi-asserted-by":"publisher","first-page":"894","DOI":"10.2307\/2274750","volume":"54","author":"H Friedman","year":"1989","unstructured":"Friedman, H., Stanley, L.: A Borel reducibility theory for classes of countable structures. J. Symb. Log. 54(3), 894\u2013914 (1989). https:\/\/doi.org\/10.2307\/2274750","journal-title":"J. Symb. Log."},{"key":"9_CR16","volume-title":"Invariant Descriptive Set Theory","author":"S Gao","year":"2009","unstructured":"Gao, S.: Invariant Descriptive Set Theory. CRC Press, Boca Raton (2009)"},{"issue":"1","key":"9_CR17","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1007\/BF01700692","volume":"38","author":"K G\u00f6del","year":"1931","unstructured":"G\u00f6del, K.: \u00dcber formal unentscheidbare S\u00e4tze der Principia Mathematica und verwandter Systeme. I. Monatsh. Math. Phys. 38(1), 173\u2013198 (1931). https:\/\/doi.org\/10.1007\/BF01700692","journal-title":"Math. Phys."},{"issue":"5","key":"9_CR18","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1007\/BF01669607","volume":"19","author":"SS Goncharov","year":"1980","unstructured":"Goncharov, S.S.: Computable single-valued numerations. Algebra Logic 19(5), 325\u2013356 (1980). https:\/\/doi.org\/10.1007\/BF01669607","journal-title":"Algebra Logic"},{"issue":"5","key":"9_CR19","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1007\/BF01982111","volume":"22","author":"SS Goncharov","year":"1983","unstructured":"Goncharov, S.S.: Positive numerations of families with one-valued numerations. Algebra Logic 22(5), 345\u2013350 (1983). https:\/\/doi.org\/10.1007\/BF01982111","journal-title":"Algebra Logic"},{"issue":"2","key":"9_CR20","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1023\/A:1015352513117","volume":"41","author":"SS Goncharov","year":"2002","unstructured":"Goncharov, S.S., Lempp, S., Solomon, D.R.: Friedberg numberings of families of $$n$$-computably enumerable sets. Algebra Logic 41(2), 81\u201386 (2002). https:\/\/doi.org\/10.1023\/A:1015352513117","journal-title":"Algebra Logic"},{"issue":"6","key":"9_CR21","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1007\/BF02671553","volume":"36","author":"SS Goncharov","year":"1997","unstructured":"Goncharov, S.S., Sorbi, A.: Generalized computable numerations and nontrivial Rogers semilattices. Algebra Logic 36(6), 359\u2013369 (1997). https:\/\/doi.org\/10.1007\/BF02671553","journal-title":"Algebra Logic"},{"key":"9_CR22","unstructured":"Herbert, I., Jain, S., Lempp, S., Mustafa, M., Stephan, F.: Reductions between types of numberings (2017, preprint)"},{"issue":"3\u20134","key":"9_CR23","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1016\/j.jcss.2009.08.001","volume":"76","author":"S Jain","year":"2010","unstructured":"Jain, S., Stephan, F.: Numberings optimal for learning. J. Comput. Syst. Sci. 76(3\u20134), 233\u2013250 (2010). https:\/\/doi.org\/10.1016\/j.jcss.2009.08.001","journal-title":"J. Comput. Syst. Sci."},{"issue":"5","key":"9_CR24","doi-asserted-by":"publisher","first-page":"348","DOI":"10.1007\/BF02219842","volume":"10","author":"AB Khutoretskii","year":"1971","unstructured":"Khutoretskii, A.B.: On the cardinality of the upper semilattice of computable enumerations. Algebra Logic 10(5), 348\u2013352 (1971). https:\/\/doi.org\/10.1007\/BF02219842","journal-title":"Algebra Logic"},{"key":"9_CR25","volume-title":"Introduction to Metamathematics","author":"SC Kleene","year":"1952","unstructured":"Kleene, S.C.: Introduction to Metamathematics. Van Nostrand, New York (1952)"},{"issue":"4","key":"9_CR26","first-page":"3","volume":"13","author":"AN Kolmogorov","year":"1958","unstructured":"Kolmogorov, A.N., Uspenskii, V.A.: On the definition of an algorithm. Uspehi Mat. Nauk 13(4), 3\u201328 (1958). (in Russian)","journal-title":"Uspehi Mat. Nauk"},{"issue":"2\u20133","key":"9_CR27","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1002\/malq.19640100203","volume":"10","author":"AH Lachlan","year":"1964","unstructured":"Lachlan, A.H.: Standard classes of recursively enumerable sets. Z. Math. Logik Grundlagen Math. 10(2\u20133), 23\u201342 (1964). https:\/\/doi.org\/10.1002\/malq.19640100203","journal-title":"Z. Math. Logik Grundlagen Math."},{"issue":"3","key":"9_CR28","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1002\/malq.19650110305","volume":"11","author":"AH Lachlan","year":"1965","unstructured":"Lachlan, A.H.: On recursive enumeration without repetition. Z. Math. Logik Grundlagen Math. 11(3), 209\u2013220 (1965). https:\/\/doi.org\/10.1002\/malq.19650110305","journal-title":"Z. Math. Logik Grundlagen Math."},{"key":"9_CR29","first-page":"75","volume":"6","author":"AI Mal\u2019cev","year":"1965","unstructured":"Mal\u2019cev, A.I.: Positive and negative numerations. Sov. Math. Dokl. 6, 75\u201377 (1965)","journal-title":"Sov. Math. Dokl."},{"key":"9_CR30","unstructured":"Maslova, T.M.: Bounded $$m$$-reducibilities. In: Golunkov, Y.V. (ed.) Veroyatnostnye Metody i Kibernetika, vol. XV, pp. 51\u201360. Kazan University, Kazan (1979). (in Russian), MR0577649"},{"issue":"4","key":"9_CR31","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1007\/s10469-015-9349-2","volume":"54","author":"SS Ospichev","year":"2015","unstructured":"Ospichev, S.S.: Friedberg numberings in the Ershov hierarchy. Algebra Logic 54(4), 283\u2013295 (2015). https:\/\/doi.org\/10.1007\/s10469-015-9349-2","journal-title":"Algebra Logic"},{"issue":"6","key":"9_CR32","doi-asserted-by":"publisher","first-page":"1109","DOI":"10.1007\/s11202-008-0107-8","volume":"49","author":"SY Podzorov","year":"2008","unstructured":"Podzorov, S.Y.: Arithmetical $$D$$-degrees. Sib. Math. J. 49(6), 1109\u20131123 (2008). https:\/\/doi.org\/10.1007\/s11202-008-0107-8","journal-title":"Sib. Math. J."},{"issue":"2","key":"9_CR33","doi-asserted-by":"publisher","first-page":"252","DOI":"10.2307\/2034045","volume":"15","author":"MB Pour-El","year":"1964","unstructured":"Pour-El, M.B.: G\u00f6del numberings versus Friedberg numberings. Proc. Am. Math. Soc. 15(2), 252\u2013256 (1964). https:\/\/doi.org\/10.2307\/2034045","journal-title":"Proc. Am. Math. Soc."},{"issue":"3","key":"9_CR34","doi-asserted-by":"publisher","first-page":"331","DOI":"10.2307\/2964292","volume":"23","author":"H Rogers","year":"1958","unstructured":"Rogers, H.: G\u00f6del numberings of partial recursive functions. J. Symb. Logic 23(3), 331\u2013341 (1958). https:\/\/doi.org\/10.2307\/2964292","journal-title":"J. Symb. Logic"},{"issue":"4","key":"9_CR35","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1007\/BF01875946","volume":"15","author":"VL Selivanov","year":"1976","unstructured":"Selivanov, V.L.: Two theorems on computable numberings. Algebra Logic 15(4), 297\u2013306 (1976). https:\/\/doi.org\/10.1007\/BF01875946","journal-title":"Algebra Logic"},{"key":"9_CR36","first-page":"1155","volume":"105","author":"VA Uspenskii","year":"1958","unstructured":"Uspenskii, V.A.: Systems of denumerable sets and their enumeration. Dokl. Akad. Nauk SSSR 105, 1155\u20131158 (1958). (in Russian)","journal-title":"Dokl. Akad. Nauk SSSR"}],"container-title":["Lecture Notes in Computer Science","Computing with Foresight and Industry"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-22996-2_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T11:19:57Z","timestamp":1709810397000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-22996-2_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030229955","9783030229962"],"references-count":36,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-22996-2_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"19 June 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CiE","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Conference on Computability in Europe","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Durham","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Kingdom","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 July 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 July 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cie2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/community.dur.ac.uk\/cie.2019\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"35","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"20","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"57% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Also included are 7 invited papers","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}