{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,10]],"date-time":"2026-06-10T08:56:12Z","timestamp":1781081772322,"version":"3.54.1"},"reference-count":21,"publisher":"SAGE Publications","issue":"2","license":[{"start":{"date-parts":[[2022,5,11]],"date-time":"2022-05-11T00:00:00Z","timestamp":1652227200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/journals.sagepub.com\/page\/policies\/text-and-data-mining-license"}],"content-domain":{"domain":["journals.sagepub.com"],"crossmark-restriction":true},"short-container-title":["Computability"],"published-print":{"date-parts":[[2022,5,13]]},"abstract":"<jats:p>We study relative precompleteness in the context of the theory of numberings, and relate this to a notion of lowness. We introduce a notion of divisibility for numberings, and use it to show that for the class of divisible numberings, lowness and relative precompleteness coincide with being computable.<\/jats:p>\n                  <jats:p>We also study the complexity of Skolem functions arising from Arslanov\u2019s completeness criterion with parameters. We show that for suitably divisible numberings, these Skolem functions have the maximal possible Turing degree. In particular this holds for the standard numberings of the partial computable functions and the c.e.\u00a0sets.<\/jats:p>","DOI":"10.3233\/com-210344","type":"journal-article","created":{"date-parts":[[2022,5,13]],"date-time":"2022-05-13T12:18:03Z","timestamp":1652444283000},"page":"135-146","update-policy":"https:\/\/doi.org\/10.1177\/sage-journals-update-policy","source":"Crossref","is-referenced-by-count":4,"title":["Fixpoints and relative precompleteness"],"prefix":"10.1177","volume":"11","author":[{"given":"Anton","family":"Golov","sequence":"first","affiliation":[{"name":"Department of Mathematics, Radboud University Nijmegen, P.O. Box 9010, 6500 GL Nijmegen, The Netherlands"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Sebastiaan A.","family":"Terwijn","sequence":"additional","affiliation":[{"name":"Department of Mathematics, Radboud University Nijmegen, P.O. Box 9010, 6500 GL Nijmegen, The Netherlands"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"179","published-online":{"date-parts":[[2022,5,11]]},"reference":[{"key":"ref001","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-50062-1_25"},{"key":"ref002","doi-asserted-by":"publisher","DOI":"10.1017\/jsl.2013.8"},{"key":"ref003","doi-asserted-by":"publisher","DOI":"10.1016\/j.apal.2017.12.001"},{"key":"ref004","doi-asserted-by":"publisher","DOI":"10.3233\/COM-180098"},{"issue":"5","key":"ref005","first-page":"1","volume":"25","author":"Arslanov M.M.","year":"1981","journal-title":"Soviet Mathematics (Izvestiya VUZ. Matematika)"},{"key":"ref006","doi-asserted-by":"publisher","DOI":"10.1016\/j.apal.2019.04.013"},{"key":"ref007","doi-asserted-by":"publisher","DOI":"10.2307\/2273443"},{"key":"ref008","doi-asserted-by":"publisher","DOI":"10.1002\/malq.19730191901"},{"key":"ref009","doi-asserted-by":"publisher","DOI":"10.1002\/malq.19750210164"},{"key":"ref010","doi-asserted-by":"publisher","DOI":"10.1017\/S0022481200041104"},{"key":"ref011","doi-asserted-by":"publisher","DOI":"10.2307\/2267778"},{"key":"ref012","doi-asserted-by":"publisher","DOI":"10.1002\/malq.19870330106"},{"key":"ref013","doi-asserted-by":"publisher","DOI":"10.2178\/bsl\/1286889124"},{"key":"ref014","unstructured":"P.\u00a0Odifreddi, Classical Recursion Theory, Vol. 1, Studies in Logic and the Foundations of Mathematics, Vol.\u00a0125, North-Holland, Amsterdam, 1989."},{"issue":"3","key":"ref015","first-page":"343","volume":"27","author":"Selivanov V.L.","year":"1988","journal-title":"Algebra i Logika"},{"issue":"1","key":"ref016","first-page":"149","volume":"51","author":"Selivanov V.L.","year":"1992","journal-title":"Matematicheskie Zametki"},{"key":"ref017","unstructured":"V.L.\u00a0Selivanov, in: Precomplete Numberings, Itogi Nauki i Tekhniki, Sovremennaya Matematika i ee Prilozheniya, Tematicheskie Obzory, Vol.\u00a0157, 2018, pp.\u00a0106\u2013134."},{"key":"ref018","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-02460-7"},{"key":"ref019","doi-asserted-by":"publisher","DOI":"10.1017\/jsl.2018.52"},{"key":"ref020","doi-asserted-by":"publisher","DOI":"10.1007\/s00153-020-00712-z"},{"key":"ref021","unstructured":"A.\u00a0Visser, Numerations,\n                      \u03bb\n                      -calculus, and arithmetic, in: To H.B. Curry: Essays on Combinatory Logic, Lambda Calculus and Formalism, J.P.\u00a0Seldin and J.R.\u00a0Hindley, eds, Academic Press, 1980, pp.\u00a0259\u2013284."}],"container-title":["Computability"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.3233\/COM-210344","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/full-xml\/10.3233\/COM-210344","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.3233\/COM-210344","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,28]],"date-time":"2026-04-28T16:02:53Z","timestamp":1777392173000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/full\/10.3233\/COM-210344"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,5,11]]},"references-count":21,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2022,5,13]]}},"alternative-id":["10.3233\/COM-210344"],"URL":"https:\/\/doi.org\/10.3233\/com-210344","relation":{},"ISSN":["2211-3568","2211-3576"],"issn-type":[{"value":"2211-3568","type":"print"},{"value":"2211-3576","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,5,11]]}}}