{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T09:29:55Z","timestamp":1763458195101,"version":"3.40.3"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031203497"},{"type":"electronic","value":"9783031203503"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-20350-3_8","type":"book-chapter","created":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T05:12:32Z","timestamp":1672549952000},"page":"79-92","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["On Two Types of\u00a0Concept Lattices in\u00a0the\u00a0Theory of\u00a0Numberings"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5834-2770","authenticated-orcid":false,"given":"Nikolay","family":"Bazhenov","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8259-4441","authenticated-orcid":false,"given":"Manat","family":"Mustafa","sequence":"additional","affiliation":[]},{"given":"Anvar","family":"Nurakunov","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,1,1]]},"reference":[{"key":"8_CR1","unstructured":"Ash, C.J., Knight, J.F.: Computable structures and the hyperarithmetical hierarchy, Stud. Logic Found. Math., vol. 144. Elsevier Science B.V., Amsterdam (2000)"},{"key":"8_CR2","doi-asserted-by":"publisher","unstructured":"Badaev, S.A., Goncharov, S.S.: The 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":"1","key":"8_CR3","doi-asserted-by":"publisher","first-page":"85","DOI":"10.2307\/2273356","volume":"45","author":"JE Baumgartner","year":"1980","unstructured":"Baumgartner, J.E.: Chains and antichains in $$\\cal{P} (\\omega )$$. J. Symb. Log. 45(1), 85\u201392 (1980). https:\/\/doi.org\/10.2307\/2273356","journal-title":"J. Symb. Log."},{"issue":"4","key":"8_CR4","doi-asserted-by":"publisher","first-page":"1630","DOI":"10.1017\/jsl.2019.26","volume":"84","author":"N Bazhenov","year":"2019","unstructured":"Bazhenov, N., Harrison-Trainor, M., Kalimullin, I., Melnikov, A., Ng, K.M.: Automatic and polynomial-time algebraic structures. J. Symb. Log. 84(4), 1630\u20131669 (2019). https:\/\/doi.org\/10.1017\/jsl.2019.26","journal-title":"J. Symb. Log."},{"issue":"2","key":"8_CR5","doi-asserted-by":"publisher","first-page":"191","DOI":"10.2178\/bsl\/1146620059","volume":"12","author":"W Calvert","year":"2006","unstructured":"Calvert, W., Knight, J.F.: Classification from a computable viewpoint. Bull. Symb. Log. 12(2), 191\u2013218 (2006). https:\/\/doi.org\/10.2178\/bsl\/1146620059","journal-title":"Bull. Symb. Log."},{"key":"8_CR6","unstructured":"Ershov, Y.L.: Theory of Numberings. Nauka, Moscow (1977). (in Russian)"},{"key":"8_CR7","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":"4","key":"8_CR8","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1023\/A:1025005309632","volume":"42","author":"YL Ershov","year":"2003","unstructured":"Ershov, Y.L.: Necessary isomorphism conditions for Rogers semilattices of finite partially ordered sets. Algebra Logic 42(4), 232\u2013236 (2003). https:\/\/doi.org\/10.1023\/A:1025005309632","journal-title":"Algebra Logic"},{"issue":"1","key":"8_CR9","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1007\/s10469-006-0004-9","volume":"45","author":"YL Ershov","year":"2006","unstructured":"Ershov, Y.L.: Rogers semilattices of finite partially ordered sets. Algebra Logic 45(1), 26\u201348 (2006). https:\/\/doi.org\/10.1007\/s10469-006-0004-9","journal-title":"Algebra Logic"},{"key":"8_CR10","doi-asserted-by":"publisher","unstructured":"Fokina, E.B., Harizanov, V., Melnikov, A.: Computable model theory. In: Downey, R. (ed.) Turing\u2019s Legacy: Developments from Turing\u2019s Ideas in Logic. Lectures Notes Logic, vol. 42, pp. 124\u2013194. Cambridge University Press, Cambridge (2014). https:\/\/doi.org\/10.1017\/CBO9781107338579.006","DOI":"10.1017\/CBO9781107338579.006"},{"key":"8_CR11","doi-asserted-by":"publisher","unstructured":"Fremlin, D.H.: Consequences of Martin\u2019s Axiom. Cambridge Tracts in Mathematics, vol. 84. Cambridge University Press, Cambridge (1984). https:\/\/doi.org\/10.1017\/CBO9780511896972","DOI":"10.1017\/CBO9780511896972"},{"key":"8_CR12","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-59830-2","volume-title":"Formal Concept Analysis: Mathematical Foundations","author":"B Ganter","year":"1999","unstructured":"Ganter, B., Wille, R.: Formal Concept Analysis: Mathematical Foundations. Springer, Berlin (1999). https:\/\/doi.org\/10.1007\/978-3-642-59830-2"},{"issue":"1","key":"8_CR13","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":"6","key":"8_CR14","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1023\/A:1021758312697","volume":"41","author":"SS Goncharov","year":"2002","unstructured":"Goncharov, S.S., Knight, J.F.: Computable structure and non-structure theorems. Algebra Logic 41(6), 351\u2013373 (2002). https:\/\/doi.org\/10.1023\/A:1021758312697","journal-title":"Algebra Logic"},{"issue":"6","key":"8_CR15","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"},{"issue":"1\u20133","key":"8_CR16","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1016\/S0168-0072(01)00087-2","volume":"115","author":"DR Hirschfeldt","year":"2002","unstructured":"Hirschfeldt, D.R., Khoussainov, B., Shore, R.A., Slinko, A.M.: Degree spectra and computable dimensions in algebraic structures. Ann. Pure Appl. Logic 115(1\u20133), 71\u2013113 (2002). https:\/\/doi.org\/10.1016\/S0168-0072(01)00087-2","journal-title":"Ann. Pure Appl. Logic"},{"issue":"4","key":"8_CR17","doi-asserted-by":"publisher","first-page":"150","DOI":"10.2307\/2267778","volume":"3","author":"SC Kleene","year":"1938","unstructured":"Kleene, S.C.: On notation for ordinal numbers. J. Symb. Log. 3(4), 150\u2013155 (1938). https:\/\/doi.org\/10.2307\/2267778","journal-title":"J. Symb. Log."},{"issue":"4","key":"8_CR18","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":"1","key":"8_CR19","doi-asserted-by":"publisher","first-page":"127","DOI":"10.2307\/1995467","volume":"155","author":"TG McLaughlin","year":"1971","unstructured":"McLaughlin, T.G.: The family of all recursively enumerable classes of finite sets. Trans. Am. Math. Soc. 155(1), 127\u2013136 (1971). https:\/\/doi.org\/10.2307\/1995467","journal-title":"Trans. Am. Math. Soc."},{"issue":"3","key":"8_CR20","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."},{"key":"8_CR21","series-title":"Theory and Applications of Computability","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-31933-4_17","volume-title":"Turing Computability","author":"RI Soare","year":"2016","unstructured":"Soare, R.I.: Turing Computability. TAC, Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-642-31933-4_17"},{"key":"8_CR22","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"},{"key":"8_CR23","unstructured":"Wehner, S.: Computable enumeration and the problem of repetition. Ph.D. thesis, Simon Fraser University (1995)"},{"key":"8_CR24","doi-asserted-by":"publisher","unstructured":"Wille, R.: Restructuring lattice theory: an approach based on hierarchies of concepts. In: Rival, I. (ed.) Ordered Sets, pp. 445\u2013470. D. Reidel Publishing Company, Dordrecht (1982). https:\/\/doi.org\/10.1007\/978-94-009-7798-3_15","DOI":"10.1007\/978-94-009-7798-3_15"}],"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-031-20350-3_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T05:21:41Z","timestamp":1672550501000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-20350-3_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031203497","9783031203503"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-20350-3_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"1 January 2023","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":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 September 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 September 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"tamc2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/lxy.tjut.edu.cn\/TAMC2022.htm","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":"EquinOCS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"75","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":"33","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":"44% - 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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}