{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,26]],"date-time":"2026-02-26T15:20:47Z","timestamp":1772119247877,"version":"3.50.1"},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2024,2,23]],"date-time":"2024-02-23T00:00:00Z","timestamp":1708646400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,2,23]],"date-time":"2024-02-23T00:00:00Z","timestamp":1708646400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/100009409","name":"Russian Science Support Foundation","doi-asserted-by":"publisher","award":["23-21-00181"],"award-info":[{"award-number":["23-21-00181"]}],"id":[{"id":"10.13039\/100009409","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Theory Comput Syst"],"published-print":{"date-parts":[[2024,4]]},"DOI":"10.1007\/s00224-024-10165-z","type":"journal-article","created":{"date-parts":[[2024,2,23]],"date-time":"2024-02-23T07:02:51Z","timestamp":1708671771000},"page":"271-282","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On Non-principal Arithmetical Numberings and Families"],"prefix":"10.1007","volume":"68","author":[{"given":"Marat","family":"Faizrahmanov","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,2,23]]},"reference":[{"key":"10165_CR1","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1007\/978-1-4615-0755-0_2","volume-title":"Computability and Models","author":"SA Badaev","year":"2003","unstructured":"Badaev, S.A., Goncharov, S.S., Sorbi, A.: Completeness and universality of arithmetical numberings. In: Cooper, S.B., Goncharov, S.S. (eds.) Computability and Models, pp. 11\u201344. Kluwer \/ Plenum Publishers, New York (2003)"},{"issue":"2","key":"10165_CR2","first-page":"104","volume":"15","author":"SY Podzorov","year":"2005","unstructured":"Podzorov, S.Y.: Dual covers of the greatest element of the Rogers semilattice. Siberian Adv. Math. 15(2), 104\u2013114 (2005)","journal-title":"Siberian Adv. Math."},{"issue":"5","key":"10165_CR3","first-page":"355","volume":"53","author":"SA Badaev","year":"2014","unstructured":"Badaev, S.A., Goncharov, S.S.: Generalized computable universal numberings. Algebra Log. 53(5), 355\u2013364 (2014)","journal-title":"Generalized computable universal numberings. Algebra Log."},{"issue":"1","key":"10165_CR4","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1017\/S1755020320000192","volume":"14","author":"B Grabmayr","year":"2021","unstructured":"Grabmayr, B.: On the invariance of G\u00f6del\u2019s second theorem with regard to numberings. Review of Symbol. Log. 14(1), 51\u201384 (2021)","journal-title":"Review of Symbol. Log."},{"issue":"2","key":"10165_CR5","first-page":"353","volume":"2","author":"AI Mal\u2019tsev","year":"1963","unstructured":"Mal\u2019tsev, A.I.: Sets with complete numberings. Algebra Log. 2(2), 353\u2013378 (1963)","journal-title":"Sets with complete numberings. Algebra Log."},{"key":"10165_CR6","volume-title":"The Metamathematics of Algebraic Systems","author":"AI Mal\u2019tsev","year":"1971","unstructured":"Mal\u2019tsev, A.I.: The Metamathematics of Algebraic Systems. North-Holland, Amsterdam (1971)"},{"issue":"5","key":"10165_CR7","doi-asserted-by":"publisher","first-page":"773","DOI":"10.1007\/BF00971653","volume":"10","author":"YL Ershov","year":"1969","unstructured":"Ershov, Y.L.: Completely enumerated sets. Sib. Math. J. 10(5), 773\u2013784 (1969)","journal-title":"Sib. Math. J."},{"issue":"6","key":"10165_CR8","doi-asserted-by":"publisher","first-page":"396","DOI":"10.1007\/BF02219043","volume":"9","author":"YL Ershov","year":"1970","unstructured":"Ershov, Y.L.: On inseparable pairs. Algebra Log. 9(6), 396\u2013399 (1970)","journal-title":"On inseparable pairs. Algebra Log."},{"issue":"5","key":"10165_CR9","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1007\/BF02321892","volume":"9","author":"SD Denisov","year":"1970","unstructured":"Denisov, S.D., Lavrov, I.A.: Complete numerations with infinitely many singular elements. Algebra Log. 9(5), 301\u2013304 (1970)","journal-title":"Algebra Log."},{"issue":"1","key":"10165_CR10","doi-asserted-by":"publisher","first-page":"357","DOI":"10.2307\/2694927","volume":"66","author":"S Jain","year":"2001","unstructured":"Jain, S., Nessel, J.: Some independence results for control structures in complete numberings. J. Symb. Log. 66(1), 357\u2013382 (2001)","journal-title":"J. Symb. Log."},{"issue":"6","key":"10165_CR11","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1007\/s10469-006-0039-y","volume":"45","author":"ZG Khisamiev","year":"2006","unstructured":"Khisamiev, Z.G.: Subfamilies of special elements of complete numberings. Algebra Log. 45(6), 431\u2013434 (2006)","journal-title":"Algebra Log."},{"issue":"5","key":"10165_CR12","doi-asserted-by":"publisher","first-page":"780","DOI":"10.1007\/s11202-008-0076-y","volume":"49","author":"SA Badaev","year":"2008","unstructured":"Badaev, S.A., Goncharov, S.S., Sorbi, A.: Some remarks on completion of numberings. Sib. Math. J. 49(5), 780\u2013783 (2008)","journal-title":"Sib. Math. J."},{"key":"10165_CR13","doi-asserted-by":"crossref","unstructured":"Faizrahmanov, M.Kh.: Numberings, c.e. oracles, and fixed points. Computability. 12(3), 271\u2013282 (2023)","DOI":"10.3233\/COM-210387"},{"key":"10165_CR14","volume-title":"Theory of Numberings","author":"YL Ershov","year":"1977","unstructured":"Ershov, Y.L.: Theory of Numberings. Nauka, Moscow, Russian (1977)"},{"issue":"6","key":"10165_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 non-trivial Rogers semilattices. Algebra Log. 36(6), 359\u2013369 (1997)","journal-title":"Algebra Log."},{"issue":"4","key":"10165_CR16","doi-asserted-by":"publisher","first-page":"356","DOI":"10.1007\/s10469-019-09557-9","volume":"58","author":"MK Faizrakhmanov","year":"2019","unstructured":"Faizrakhmanov, M.K.: Khutoretskii\u2019s theorem for generalized computable families. Algebra Log. 58(4), 356\u2013365 (2019)","journal-title":"Algebra Log."},{"issue":"5","key":"10165_CR17","doi-asserted-by":"publisher","first-page":"723","DOI":"10.1134\/S0001434623050127","volume":"113","author":"MK Faizrahmanov","year":"2023","unstructured":"Faizrahmanov, M.K.: On the embedding of the first nonconstructive ordinal in the Rogers semilattices. Math Notes 113(5), 723\u2013730 (2023)","journal-title":"Math Notes"},{"issue":"4","key":"10165_CR18","doi-asserted-by":"publisher","first-page":"927","DOI":"10.1134\/S0037446623040146","volume":"64","author":"MK Faizrahmanov","year":"2023","unstructured":"Faizrahmanov, M.K.: Embedding of the first nonconstructive ordinal into the Rogers semilattices of families of arithmetic sets. Sib. Math. J. 64(4), 927\u2013935 (2023)","journal-title":"Sib. Math. J."},{"issue":"4","key":"10165_CR19","doi-asserted-by":"publisher","first-page":"616","DOI":"10.1023\/A:1016364016981","volume":"43","author":"SA Badaev","year":"2002","unstructured":"Badaev, S.A., Podzorov, S.Y.: Minimal coverings in the Rogers semilattices of $$\\Sigma ^0_n$$-computable numberings. Sib. Math. J. 43(4), 616\u2013622 (2002)","journal-title":"Sib. Math. J."},{"key":"10165_CR20","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-02460-7","volume-title":"Recursively Enumerable Sets and Degrees: A Study of Computable Functions and Computably Generated Sets","author":"RI Soare","year":"1987","unstructured":"Soare, R.I.: Recursively Enumerable Sets and Degrees: A Study of Computable Functions and Computably Generated Sets. Perspectives in Mathematical Logic. Springer-Verlag, Berlin, Heidelberg, New York (1987)"},{"key":"10165_CR21","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-31933-4","volume-title":"Turing Computability","author":"RI Soare","year":"2016","unstructured":"Soare, R.I.: Turing Computability. Theory and Applications of Computability. Springer-Verlag, Berlin, Heidelberg (2016)"},{"key":"10165_CR22","doi-asserted-by":"crossref","unstructured":"Ershov, Y.L.: Theory of numberings. In: Griffor, E.R. (ed.) Handbook of Computability Theory, vol 140 of Studies in Logic and the Foundations of Mathematics, pp. 473\u2013506. Elsevier (1999)","DOI":"10.1016\/S0049-237X(99)80030-5"},{"issue":"4","key":"10165_CR23","doi-asserted-by":"publisher","first-page":"398","DOI":"10.1002\/malq.202200035","volume":"68","author":"MK Faizrahmanov","year":"2022","unstructured":"Faizrahmanov, M.K.: Extremal numberings and fixed point theorems. Math. Log. Quart. 68(4), 398\u2013408 (2022)","journal-title":"Math. Log. Quart."},{"issue":"6","key":"10165_CR24","doi-asserted-by":"publisher","first-page":"1092","DOI":"10.4153\/CJM-1972-113-9","volume":"24","author":"CG Jockush Jr","year":"1972","unstructured":"Jockush, C.G., Jr.: Degrees in which the recursive sets are uniformly recursive. Canad. J. Math. 24(6), 1092\u20131099 (1972)","journal-title":"Canad. J. Math."},{"issue":"5","key":"10165_CR25","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1023\/A:1012516217265","volume":"40","author":"SA Badaev","year":"2001","unstructured":"Badaev, S.A., Goncharov, S.S.: Rogers semilattices of families of arithmetic sets. Algebra Log. 40(5), 283\u2013291 (2001)","journal-title":"Algebra Log."},{"issue":"3","key":"10165_CR26","doi-asserted-by":"publisher","first-page":"553","DOI":"10.1134\/S0037446617030181","volume":"58","author":"MK Faizrahmanov","year":"2017","unstructured":"Faizrahmanov, M.K.: Minimal generalized computable enumerations and high degrees. Sib. Math. J. 58(3), 553\u2013558 (2017)","journal-title":"Sib. Math. J."},{"issue":"4","key":"10165_CR27","doi-asserted-by":"publisher","first-page":"519","DOI":"10.1007\/BF00967428","volume":"15","author":"SA Badaev","year":"1974","unstructured":"Badaev, S.A.: On incomparable enumerations. Sib. Math. J. 15(4), 519\u2013524 (1974)","journal-title":"Sib. Math. J."},{"issue":"4","key":"10165_CR28","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1007\/BF02219444","volume":"9","author":"SD Denisov","year":"1970","unstructured":"Denisov, S.D.: On $$m$$-degrees of recursively enumerable sets. Algebra Log. 9(4), 254\u2013256 (1970)","journal-title":"Algebra Log."},{"issue":"6","key":"10165_CR29","doi-asserted-by":"publisher","first-page":"412","DOI":"10.1007\/BF02219655","volume":"8","author":"AB Khutoretskii","year":"1969","unstructured":"Khutoretskii, A.B.: On nonprincipal enumerations. Algebra Log. 8(6), 412\u2013415 (1969)","journal-title":"On nonprincipal enumerations. Algebra Log."}],"container-title":["Theory of Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-024-10165-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00224-024-10165-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-024-10165-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,5]],"date-time":"2024-04-05T00:02:34Z","timestamp":1712275354000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00224-024-10165-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,2,23]]},"references-count":29,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2024,4]]}},"alternative-id":["10165"],"URL":"https:\/\/doi.org\/10.1007\/s00224-024-10165-z","relation":{"has-preprint":[{"id-type":"doi","id":"10.21203\/rs.3.rs-3206594\/v1","asserted-by":"object"}]},"ISSN":["1432-4350","1433-0490"],"issn-type":[{"value":"1432-4350","type":"print"},{"value":"1433-0490","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,2,23]]},"assertion":[{"value":"6 February 2024","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 February 2024","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}]}}