{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,30]],"date-time":"2025-10-30T22:47:38Z","timestamp":1761864458497,"version":"build-2065373602"},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2025,4,26]],"date-time":"2025-04-26T00:00:00Z","timestamp":1745625600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,4,26]],"date-time":"2025-04-26T00:00:00Z","timestamp":1745625600000},"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":["Theory Comput Syst"],"published-print":{"date-parts":[[2025,6]]},"DOI":"10.1007\/s00224-025-10222-1","type":"journal-article","created":{"date-parts":[[2025,4,26]],"date-time":"2025-04-26T07:31:22Z","timestamp":1745652682000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Control Structures in Computable Numberings and the Completion Operator"],"prefix":"10.1007","volume":"69","author":[{"given":"Marat","family":"Faizrahmanov","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,4,26]]},"reference":[{"key":"10222_CR1","unstructured":"Riccardi, G.: The Independence of Control Structures in Absract Programming Systems, Ph.D. Dissertation. State University of New York at Buffalo, New York (1980)"},{"issue":"2","key":"10222_CR2","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1016\/0022-0000(81)90024-6","volume":"22","author":"G Riccardi","year":"1981","unstructured":"Riccardi, G.: The independence of control structures in abstract programming systems. J. Comp. Syst. Sci. 22(2), 107\u2013143 (1981). https:\/\/doi.org\/10.1016\/0022-0000(81)90024-6","journal-title":"J. Comp. Syst. Sci."},{"key":"10222_CR3","doi-asserted-by":"publisher","unstructured":"Royer, J.S.: A Connotational Theory of Program Structure. Springer, Berlin Heidelberg (1987). https:\/\/doi.org\/10.1007\/3-540-18253-5","DOI":"10.1007\/3-540-18253-5"},{"key":"10222_CR4","doi-asserted-by":"publisher","unstructured":"Badaev, S.A., Goncharov, S.S., Sorbi, A.: Completeness and Universality of Arithmetical Numberings, pp. 11\u201344. Springer, Boston, MA (2003). https:\/\/doi.org\/10.1007\/978-1-4615-0755-0_2","DOI":"10.1007\/978-1-4615-0755-0_2"},{"issue":"2","key":"10222_CR5","first-page":"4","volume":"2","author":"AI Mal\u2019cev","year":"1963","unstructured":"Mal\u2019cev, A.I.: Sets with complete numberings. Algebra Log. (Russian) 2(2), 4\u201329 (1963)","journal-title":"Algebra Log. (Russian)"},{"issue":"5","key":"10222_CR6","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). https:\/\/doi.org\/10.1007\/s11202-008-0076-y","journal-title":"Sib. Math. J."},{"issue":"1","key":"10222_CR7","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). https:\/\/doi.org\/10.2307\/2694927","journal-title":"J. Symb. Log."},{"key":"10222_CR8","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. Elsevier, New York (1999). https:\/\/doi.org\/10.1016\/S0049-237X(99)80030-5","DOI":"10.1016\/S0049-237X(99)80030-5"},{"key":"10222_CR9","volume-title":"Algorithms and Recursive Functions","author":"AI Mal\u2019cev","year":"1970","unstructured":"Mal\u2019cev, A.I.: Algorithms and Recursive Functions. Wolthers-Noordhoff Publishing, North Holland (1970)"},{"key":"10222_CR10","doi-asserted-by":"publisher","unstructured":"Selivanov, V.L.: Non-collapse of the effective Wadge hierarchy. In: De\u00a0Mol, L., Weiermann, A., Manea, F., Fern\u00e1ndez-Duque, D. (eds.) Connecting with Computability, pp. 407\u2013416. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-80049-9_40","DOI":"10.1007\/978-3-030-80049-9_40"},{"key":"10222_CR11","doi-asserted-by":"publisher","unstructured":"Faizrahmanov, M.K.: Numberings, c.e. oracles, and fixed points. Computability 12(3), 271\u2013282 (2023). https:\/\/doi.org\/10.3233\/com-210387","DOI":"10.3233\/com-210387"},{"issue":"5","key":"10222_CR12","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."},{"key":"10222_CR13","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, Berlin, Heidelberg (2016)"},{"key":"10222_CR14","volume-title":"Theory of Numberings","author":"YL Ershov","year":"1977","unstructured":"Ershov, Y.L.: Theory of Numberings. Nauka, Moscow (Russian) (1977)"},{"key":"10222_CR15","volume-title":"An Introduction to the General Theory of Algorithms","author":"M Machtey","year":"1978","unstructured":"Machtey, M., Young, P.: An Introduction to the General Theory of Algorithms, 2nd edn. Elsevier Science Inc., USA (1978)","edition":"2"},{"key":"10222_CR16","volume-title":"Theory of Recursive Functions and Effective Computability","author":"H Rogers","year":"1987","unstructured":"Rogers, H.: Theory of Recursive Functions and Effective Computability. The MIT Press, Cambridge, Massachusetts (1987)"},{"key":"10222_CR17","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"}],"container-title":["Theory of Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-025-10222-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00224-025-10222-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-025-10222-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,8]],"date-time":"2025-07-08T10:27:35Z","timestamp":1751970455000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00224-025-10222-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,4,26]]},"references-count":17,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2025,6]]}},"alternative-id":["10222"],"URL":"https:\/\/doi.org\/10.1007\/s00224-025-10222-1","relation":{},"ISSN":["1432-4350","1433-0490"],"issn-type":[{"type":"print","value":"1432-4350"},{"type":"electronic","value":"1433-0490"}],"subject":[],"published":{"date-parts":[[2025,4,26]]},"assertion":[{"value":"9 April 2025","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 April 2025","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"}}],"article-number":"21"}}