{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,27]],"date-time":"2026-03-27T06:23:04Z","timestamp":1774592584644,"version":"3.50.1"},"reference-count":8,"publisher":"Wiley","issue":"6","license":[{"start":{"date-parts":[[2006,11,30]],"date-time":"2006-11-30T00:00:00Z","timestamp":1164844800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Mathematical Logic Qtrly"],"published-print":{"date-parts":[[2006,12]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>We prove a completeness criterion for quasi\u2010reducibility and generalize it to higher levels of the arithmetical hierarchy. As an application of the criterion we obtain Q\u2010completeness of the set of all pairs (<jats:italic>x<\/jats:italic>,<jats:italic>n<\/jats:italic>) such that the prefix\u2010free Kolmogorov complexity of<jats:italic>x<\/jats:italic>is less than<jats:italic>n<\/jats:italic>. (\u00a9 2006 WILEY\u2010VCH Verlag GmbH &amp; Co. KGaA, Weinheim)<\/jats:p>","DOI":"10.1002\/malq.200610017","type":"journal-article","created":{"date-parts":[[2006,11,30]],"date-time":"2006-11-30T15:48:05Z","timestamp":1164901685000},"page":"595-601","source":"Crossref","is-referenced-by-count":6,"title":["Quasi\u2010completeness and functions without fixed\u2010points"],"prefix":"10.1002","volume":"52","author":[{"given":"Ilnur I.","family":"Batyrshin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","published-online":{"date-parts":[[2006,11,30]]},"reference":[{"key":"e_1_2_1_2_2","unstructured":"M. M.Arslanov Local Theory of Degrees of Unsolvability and \u039402\u2010Sets (Kazan University Press 1987)."},{"key":"e_1_2_1_3_2","doi-asserted-by":"crossref","unstructured":"M. M.Arslanov Truth\u2010table complete computably enumerable sets. In: Computability and Models: Perspectives East and West (S. B Cooper and S. S. Goncharov eds.) pp. 1\u201310 (Kluwer Academic\/Plenum Publishers 2003).","DOI":"10.1007\/978-1-4615-0755-0_1"},{"key":"e_1_2_1_4_2","doi-asserted-by":"crossref","unstructured":"R. I.Soare Recursively Enumerable Sets and Degrees (Springer Berlin 1987).","DOI":"10.1007\/978-3-662-02460-7"},{"key":"e_1_2_1_5_2","doi-asserted-by":"publisher","DOI":"10.2307\/2274816"},{"key":"e_1_2_1_6_2","doi-asserted-by":"publisher","DOI":"10.2307\/2033701"},{"key":"e_1_2_1_7_2","doi-asserted-by":"crossref","unstructured":"C. H.Bennett Logical depth and physical complexity. In: The Universal Turing Machine. A Half\u2010Century Survey (R. Herken ed.) pp. 227\u2013258 (Oxford University Press 1988).","DOI":"10.1093\/oso\/9780198537748.003.0008"},{"key":"e_1_2_1_8_2","first-page":"1162","article-title":"Chaitin \u03a9 numbers and strong reducibilities","volume":"3","author":"Calude C. S.","year":"1998","journal-title":"J. Univ. Comp. Sci."},{"key":"e_1_2_1_9_2","first-page":"473","article-title":"A class of incomplete sets","volume":"20","author":"Marchenkov S. S.","year":"1976","journal-title":"Mat. Zametki"}],"container-title":["Mathematical Logic Quarterly"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fmalq.200610017","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/malq.200610017","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,8]],"date-time":"2024-02-08T17:01:17Z","timestamp":1707411677000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/malq.200610017"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,11,30]]},"references-count":8,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2006,12]]}},"alternative-id":["10.1002\/malq.200610017"],"URL":"https:\/\/doi.org\/10.1002\/malq.200610017","archive":["Portico"],"relation":{},"ISSN":["0942-5616","1521-3870"],"issn-type":[{"value":"0942-5616","type":"print"},{"value":"1521-3870","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,11,30]]}}}