{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T10:20:46Z","timestamp":1743070846311,"version":"3.40.3"},"publisher-location":"Cham","reference-count":35,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030592660"},{"type":"electronic","value":"9783030592677"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-59267-7_1","type":"book-chapter","created":{"date-parts":[[2020,10,11]],"date-time":"2020-10-11T19:02:33Z","timestamp":1602442953000},"page":"1-12","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Semilattices of Punctual 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":[[2020,10,9]]},"reference":[{"issue":"18","key":"1_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":"1_CR2","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":"1_CR3","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 Log. 16(2), 83\u201398 (1977). https:\/\/doi.org\/10.1007\/BF01668593","journal-title":"Algebra Log."},{"issue":"3","key":"1_CR4","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 Log. 33(3), 131\u2013141 (1994). https:\/\/doi.org\/10.1007\/BF00750228","journal-title":"Algebra Log."},{"key":"1_CR5","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"},{"key":"1_CR6","doi-asserted-by":"publisher","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","DOI":"10.2178\/jsl\/1243948330"},{"key":"1_CR7","doi-asserted-by":"publisher","unstructured":"Bazhenov, N., Mustafa, M., Yamaleev, M.: Elementary theories and hereditary undecidability for semilattices of numberings. Arch. Math. Log. 58(3\u20134), 485\u2013500 (2019). https:\/\/doi.org\/10.1007\/s00153-018-0647-y","DOI":"10.1007\/s00153-018-0647-y"},{"issue":"2","key":"1_CR8","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1017\/bsl.2019.20","volume":"25","author":"N Bazhenov","year":"2019","unstructured":"Bazhenov, N., Downey, R., Kalimullin, I., Melnikov, A.: Foundations of online structure theory. Bull. Symb. Log. 25(2), 141\u2013181 (2019). https:\/\/doi.org\/10.1017\/bsl.2019.20","journal-title":"Bull. Symb. Log."},{"key":"1_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":"1_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":"1_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 Log. 7(5), 330\u2013346 (1968). https:\/\/doi.org\/10.1007\/BF02219286","journal-title":"Algebra Log."},{"key":"1_CR12","unstructured":"Ershov, Y.L.: Theory of Numberings. Nauka, Moscow (1977). (in Russian)"},{"key":"1_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"},{"key":"1_CR14","doi-asserted-by":"publisher","unstructured":"Friedberg, R.M.: Three theorems on recursive enumeration. I. Decomposition. II. Maximal set. III. Enumeration without duplication. J. Symb. Log. 23(3), 309\u2013316 (1958). https:\/\/doi.org\/10.2307\/2964290","DOI":"10.2307\/2964290"},{"issue":"1","key":"1_CR15","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. Monatshefte f\u00fcr Mathematik und Physik 38(1), 173\u2013198 (1931). https:\/\/doi.org\/10.1007\/BF01700692","journal-title":"Monatshefte f\u00fcr Mathematik und Physik"},{"issue":"5","key":"1_CR16","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 Log. 19(5), 325\u2013356 (1980). https:\/\/doi.org\/10.1007\/BF01669607","journal-title":"Algebra Log."},{"issue":"5","key":"1_CR17","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 Log. 22(5), 345\u2013350 (1983). https:\/\/doi.org\/10.1007\/BF01982111","journal-title":"Algebra Log."},{"issue":"2","key":"1_CR18","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 Log. 41(2), 81\u201386 (2002). https:\/\/doi.org\/10.1023\/A:1015352513117","journal-title":"Algebra Log."},{"issue":"6","key":"1_CR19","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 Log. 36(6), 359\u2013369 (1997). https:\/\/doi.org\/10.1007\/BF02671553","journal-title":"Algebra Log."},{"issue":"12","key":"1_CR20","doi-asserted-by":"publisher","first-page":"102716","DOI":"10.1016\/j.apal.2019.102716","volume":"170","author":"I Herbert","year":"2019","unstructured":"Herbert, I., Jain, S., Lempp, S., Mustafa, M., Stephan, F.: Reductions between types of numberings. Ann. Pure Appl. Logic 170(12), 102716 (2019). https:\/\/doi.org\/10.1016\/j.apal.2019.102716","journal-title":"Ann. Pure Appl. Logic"},{"issue":"3\u20134","key":"1_CR21","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."},{"key":"1_CR22","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/j.tcs.2017.01.029","volume":"674","author":"I Kalimullin","year":"2017","unstructured":"Kalimullin, I., Melnikov, A., Ng, K.M.: Algebraic structures computable without delay. Theor. Comput. Sci. 674, 73\u201398 (2017). https:\/\/doi.org\/10.1016\/j.tcs.2017.01.029","journal-title":"Theor. Comput. Sci."},{"issue":"5","key":"1_CR23","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 Log. 10(5), 348\u2013352 (1971). https:\/\/doi.org\/10.1007\/BF02219842","journal-title":"Algebra Log."},{"key":"1_CR24","unstructured":"Kleene, S.C.: Introduction to Metamathematics. Van Nostrand, New York (1952)"},{"issue":"4","key":"1_CR25","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":"1_CR26","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":"1_CR27","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":"1_CR28","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":"1_CR29","doi-asserted-by":"publisher","unstructured":"Metakides, G., Nerode, A.: The introduction of nonrecursive methods into mathematics. In: The L. E. J. Brouwer Centenary Symposium (Noordwijkerhout, 1981). Studies in Logic and the Foundations of Mathematics, vol. 110, pp. 319\u2013335. North-Holland, Amsterdam (1982). https:\/\/doi.org\/10.1016\/S0049-237X(09)70135-1","DOI":"10.1016\/S0049-237X(09)70135-1"},{"issue":"4","key":"1_CR30","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 Log. 54(4), 283\u2013295 (2015). https:\/\/doi.org\/10.1007\/s10469-015-9349-2","journal-title":"Algebra Log."},{"issue":"6","key":"1_CR31","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":"1_CR32","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":"1_CR33","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. Log. 23(3), 331\u2013341 (1958). https:\/\/doi.org\/10.2307\/2964292","journal-title":"J. Symb. Log."},{"issue":"4","key":"1_CR34","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 Log. 15(4), 297\u2013306 (1976). https:\/\/doi.org\/10.1007\/BF01875946","journal-title":"Algebra Log."},{"key":"1_CR35","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","Theory and Applications of Models of Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-59267-7_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T18:08:11Z","timestamp":1710353291000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-59267-7_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030592660","9783030592677"],"references-count":35,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-59267-7_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"9 October 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"TAMC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Theory and Applications of Models of Computation","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Changsha","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 October 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 October 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"tamc2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/tamc2020.csu.edu.cn\/","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":"83","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":"37","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":"45% - 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":"7","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":"The conference was held virtually due to the COVID-19 pandemic.","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)"}}]}}