{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:10:25Z","timestamp":1725455425350},"publisher-location":"Berlin\/Heidelberg","reference-count":15,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"3540167838"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0016275","type":"book-chapter","created":{"date-parts":[[2005,11,13]],"date-time":"2005-11-13T05:39:17Z","timestamp":1131860357000},"page":"493-500","source":"Crossref","is-referenced-by-count":37,"title":["An alternative, priority-free, solution to Post's problem"],"prefix":"10.1007","author":[{"given":"Anton\u00edn","family":"Ku\u010dera","sequence":"first","affiliation":[]}],"member":"297","reference":[{"issue":"5","key":"46_CR1","first-page":"9","volume":"228","author":"M.M. Arslanov","year":"1981","unstructured":"Arslanov, M.M. (1981) On some general theorems about fixed points, Mathematical University News, 228, No5, 9\u201316.","journal-title":"Mathematical University News"},{"issue":"4","key":"46_CR2","first-page":"13","volume":"275","author":"M.M. Arslanov","year":"1985","unstructured":"Arslanov, M.M. (1985) Classes of recursively enumerable sets and their degrees of unsolvability, Mathematical University News, 275, No4, 13\u201319.","journal-title":"Mathematical University News"},{"key":"46_CR3","doi-asserted-by":"crossref","first-page":"236","DOI":"10.1073\/pnas.43.2.236","volume":"43","author":"R.M. Friedberg","year":"1957","unstructured":"Friedberg, R.M. (1957) Two recursively enumerable sets of incomparable degrees of unsolvability, Proc. Nat. Acad. Sci. U.S.A. 43, 236\u2013238.","journal-title":"Proc. Nat. Acad. Sci. U.S.A."},{"first-page":"631","volume-title":"Handbook of mathematical logic","year":"1977","key":"46_CR4","unstructured":"Handbook of mathematical logic (J. Barwise ed.) (1977) Simpson, S.G. Degrees of unsolvability: A survey of results, North-Holland, Amsterdam, 631\u2013652."},{"key":"46_CR5","doi-asserted-by":"crossref","first-page":"605","DOI":"10.2140\/pjm.1972.40.605","volume":"40","author":"C.G. Jockusch Jr.","year":"1972","unstructured":"Jockusch, C.G. Jr., Soare, R.I. (1972) Degrees of members of \u220f\n 1\n 0\n classes, Pacific J. Math., 40, 605\u2013616.","journal-title":"Pacific J. Math."},{"key":"46_CR6","first-page":"33","volume":"173","author":"C.G. Jockusch Jr.","year":"1972","unstructured":"Jockusch, C.G. Jr., Soare, R.I. (1972) \u220f\n 1\n 0\n classes and degrees of theories, Trans. Amer. Math. Soc., 173, 33\u201356.","journal-title":"Trans. Amer. Math. Soc."},{"key":"46_CR7","doi-asserted-by":"crossref","first-page":"809","DOI":"10.2307\/2273100","volume":"47","author":"W. Maass","year":"1982","unstructured":"Maass, W. (1982) Recursively enumerable generic sets, J. Symbolic Logic, 47, 809\u2013823.","journal-title":"J. Symbolic Logic"},{"key":"46_CR8","first-page":"194","volume":"108","author":"A.A. Muchnik","year":"1956","unstructured":"Muchnik, A.A. (1956) On the unsolvability of the problem of reducibility in the theory of algorithms, Dokl. A. Nauk SSSR 108, 194\u2013197.","journal-title":"Dokl. A. Nauk SSSR"},{"key":"46_CR9","first-page":"285","volume":"50","author":"E.L. Post","year":"1944","unstructured":"Post, E.L. (1944) Recursively enumerable sets of integers and their decision problems, Bull. Amer. Math. Soc. 50, 285\u2013316.","journal-title":"Bull. Amer. Math. Soc."},{"volume-title":"Theory of recursive functions and effective computability","year":"1967","author":"H. Rogers Jr.","key":"46_CR10","unstructured":"Rogers, H. Jr. (1967) Theory of recursive functions and effective computability, McGraw-Hill, New York."},{"key":"46_CR11","unstructured":"Soare, R.I. (to appear) Recursively enumerable sets and degrees, Omega Series in Logic, Springer-Verlag, Berlin and New York."},{"key":"46_CR12","doi-asserted-by":"crossref","first-page":"241","DOI":"10.2307\/2273139","volume":"47","author":"M. Stob","year":"1982","unstructured":"Stob, M. (1982) Index sets and degrees of unsolvability, J. Symbolic Logic 47, 241\u2013248.","journal-title":"J. Symbolic Logic"},{"key":"46_CR13","series-title":"Lecture Notes in Math.","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1007\/BFb0076224","volume-title":"Measure, \u220f 1 0 -classes and complete extensions of PA","author":"A. Ku\u010dera","year":"1985","unstructured":"Ku\u010dera, A. (1985) Measure, \u220f\n 1\n 0\n -classes and complete extensions of PA, Lecture Notes in Math., vol. 1141, Springer-Verlag, Berlin, 245\u2013259."},{"key":"46_CR14","unstructured":"Ku\u010dera, A. (to appear) A class of degrees of unsolvability of functions without a fixed point, Yerevan State Univ., Yerevan."},{"key":"46_CR15","unstructured":"Ku\u010dera, A. (in preparation) The role of diagonalization in constructions of r.e. sets."}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 1986"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0016275.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,9]],"date-time":"2020-12-09T21:35:56Z","timestamp":1607549756000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0016275"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["3540167838"],"references-count":15,"URL":"http:\/\/dx.doi.org\/10.1007\/bfb0016275","relation":{},"subject":[]}}