{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:13:00Z","timestamp":1725487980132},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540730002"},{"type":"electronic","value":"9783540730019"}],"license":[{"start":{"date-parts":[[2007,1,1]],"date-time":"2007-01-01T00:00:00Z","timestamp":1167609600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1007\/978-3-540-73001-9_73","type":"book-chapter","created":{"date-parts":[[2007,7,24]],"date-time":"2007-07-24T15:16:31Z","timestamp":1185290191000},"page":"685-694","source":"Crossref","is-referenced-by-count":0,"title":["A Useful Undecidable Theory"],"prefix":"10.1007","author":[{"given":"Victor L.","family":"Selivanov","sequence":"first","affiliation":[]}],"member":"297","reference":[{"doi-asserted-by":"crossref","unstructured":"Abramsky, S., Jung, A.: Domain theory. In: Handbook of Logic in Computer Science, v. 3, Oxford, pp. 1\u2013168 (1994)","key":"73_CR1","DOI":"10.1093\/oso\/9780198537625.003.0001"},{"unstructured":"Davey, B.A., Pristley, H.A.: Introduction to Lattices and Order. Cambridge (1994)","key":"73_CR2"},{"unstructured":"Ershov, Yu.L.: Theory of numberings, Moscow, Nauka (Russian) (1977)","key":"73_CR3"},{"issue":"4","key":"73_CR4","first-page":"37","volume":"20","author":"Y..L. Ershov","year":"1965","unstructured":"Ershov, Y.L., Lavrov, I.A., Taimanov, A.D., Taitslin, M.A.: Elementary theories. Uspechi Mat. Nauk (Russian)\u00a020(4), 37\u2013108 (1965)","journal-title":"Uspechi Mat. Nauk (Russian)"},{"key":"73_CR5","doi-asserted-by":"publisher","first-page":"139","DOI":"10.2307\/2272557","volume":"37","author":"L. Hay","year":"1972","unstructured":"Hay, L.: A discrete chain of degrees of index sets. J. Symbolic Logic\u00a037, 139\u2013149 (1972)","journal-title":"J. Symbolic Logic"},{"unstructured":"Hertling, P.: Unstetigkeitsgrade von Funktionen in der effectiven Analysis. PhD thesis, FernUniversit\u00e4t Hagen, Informatik-Berichte, pp. 208\u2013211 (1996)","key":"73_CR6"},{"key":"73_CR7","volume-title":"Classical Descriptive Set Theory","author":"A.S. Kechris","year":"1994","unstructured":"Kechris, A.S.: Classical Descriptive Set Theory. Springer, New York (1994)"},{"key":"73_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1007\/11780342_31","volume-title":"Logical Approaches to Computational Barriers","author":"O.V. Kudinov","year":"2006","unstructured":"Kudinov, O.V., Selivanov, V.L.: Undecidability in the homomorphic quasiorder of finite labeled forests. In: Beckmann, A., Berger, U., L\u00f6we, B., Tucker, J.V. (eds.) CiE 2006. LNCS, vol.\u00a03988, pp. 289\u2013296. Springer, Heidelberg (2006)"},{"key":"73_CR9","first-page":"55","volume":"20","author":"T.M. Kuzmina","year":"1981","unstructured":"Kuzmina, T.M.: Structure of m-degrees of index sets of families of partial recursive functions. Algebra and Logic (Russian, there is an English translation)\u00a020, 55\u201368 (1981)","journal-title":"Algebra and Logic (Russian, there is an English translation)"},{"key":"73_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/3-540-46541-3_13","volume-title":"STACS 2000","author":"S. Kosub","year":"2000","unstructured":"Kosub, S., Wagner, K.: The Boolean hierarchy of NP-partitions. In: Reichel, H., Tison, S. (eds.) STACS 2000. LNCS, vol.\u00a01770, pp. 157\u2013168. Springer, Heidelberg (2000)"},{"issue":"4","key":"73_CR11","doi-asserted-by":"publisher","first-page":"829","DOI":"10.2307\/2273476","volume":"48","author":"J. Mohrherr","year":"1983","unstructured":"Mohrherr, J.: Kleene index sets and functional m-degrees. J. Symbolic Logic\u00a048(4), 829\u2013840 (1983)","journal-title":"J. Symbolic Logic"},{"key":"73_CR12","volume-title":"Classical Recursion Theory","author":"P.G. Odifreddi","year":"1999","unstructured":"Odifreddi, P.G.: Classical Recursion Theory. Elsevier, Amsterdam (1999)"},{"unstructured":"Selivanov, V.L.: On the index sets of computable classes of finite sets. In: Algorithms and Automata, Kazan (Russian) pp. 95\u201399 (1978)","key":"73_CR13"},{"issue":"4","key":"73_CR14","first-page":"463","volume":"18","author":"V.L. Selivanov","year":"1979","unstructured":"Selivanov, V.L.: On the structure of degrees of index sets. Algebra and Logic (Russian, there is an English translation)\u00a018(4), 463\u2013480 (1979)","journal-title":"Algebra and Logic (Russian, there is an English translation)"},{"issue":"4","key":"73_CR15","first-page":"472","volume":"21","author":"V.L. Selivanov","year":"1982","unstructured":"Selivanov, V.L.: On the structure of degrees of generalized index sets. Algebra and Logic (Russian, there is an English translation)\u00a021(4), 472\u2013491 (1982)","journal-title":"Algebra and Logic (Russian, there is an English translation)"},{"issue":"1","key":"73_CR16","first-page":"77","volume":"43","author":"V.L. Selivanov","year":"2004","unstructured":"Selivanov, V.L.: Boolean hierarchy of partitions over reducible bases. Algebra and Logic (Russian, there is an English translation)\u00a043(1), 77\u2013109 (2004)","journal-title":"Algebra and Logic (Russian, there is an English translation)"},{"issue":"3","key":"73_CR17","first-page":"44","volume":"5","author":"V.L. Selivanov","year":"2005","unstructured":"Selivanov, V.L.: Variations on the Wadge reducibility. Siberian Advances in Math.\u00a05(3), 44\u201380 (2005)","journal-title":"Siberian Advances in Math."},{"unstructured":"Selivanov, V.L.: The algebra of labeled forests modulo homomorphic equivalence. In: Beckman, A., et al. (eds.) Conf. Computability, Europe-2006 University of Swansea Report Series #CSR 7-2006, pp. 241\u2013250 (full version to appear in Algebra and Logic) (2006)","key":"73_CR18"}],"container-title":["Lecture Notes in Computer Science","Computation and Logic in the Real World"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-73001-9_73","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,17]],"date-time":"2024-02-17T01:16:17Z","timestamp":1708132577000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-73001-9_73"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540730002","9783540730019"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-73001-9_73","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2007]]}}}