{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T21:52:23Z","timestamp":1649195543843},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2013,9,11]],"date-time":"2013-09-11T00:00:00Z","timestamp":1378857600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Arch. Math. Logic"],"published-print":{"date-parts":[[2014,2]]},"DOI":"10.1007\/s00153-013-0351-x","type":"journal-article","created":{"date-parts":[[2013,9,10]],"date-time":"2013-09-10T20:16:25Z","timestamp":1378844185000},"page":"1-10","source":"Crossref","is-referenced-by-count":0,"title":["Polynomial clone reducibility"],"prefix":"10.1007","volume":"53","author":[{"given":"Quinn","family":"Culver","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2013,9,11]]},"reference":[{"key":"351_CR1","doi-asserted-by":"crossref","unstructured":"\u00c1goston, I., Demetrovics, J., Hann\u00e1k, L.: On the number of clones containing all constants (a problem of R. McKenzie). In: Lectures in Universal Algebra (Szeged, 1983), Colloq. Math. Soc. J\u00e1nos Bolyai, vol. 43, pp. 21\u201325. North-Holland, Amsterdam (1986)","DOI":"10.1016\/B978-0-444-87759-8.50006-7"},{"issue":"3","key":"351_CR2","doi-asserted-by":"crossref","first-page":"332","DOI":"10.1007\/BF00968176","volume":"21","author":"V.K. Bulitko","year":"1980","unstructured":"Bulitko V.K.: Reducibility by Zhegalkin-linear tables. Sib. Math. J. 21(3), 332\u2013339 (1980)","journal-title":"Sib. Math. J."},{"issue":"5","key":"351_CR3","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1007\/BF02027227","volume":"21","author":"A. Degtev","year":"1982","unstructured":"Degtev A.: Comparison of linear reducibility with other reducibilities of tabular type. Algebra Logic Russ. 21(5), 339\u2013353 (1982)","journal-title":"Algebra Logic Russ."},{"key":"351_CR4","doi-asserted-by":"crossref","DOI":"10.1007\/978-0-387-68441-3","volume-title":"Algorithmic Randomness and Complexity","author":"R. Downey","year":"2010","unstructured":"Downey R., Hirschfeldt D.: Algorithmic Randomness and Complexity. Springer, Secaucus (2010)"},{"key":"351_CR5","unstructured":"Folland, G.B.: Real Analysis, 2nd ed. Pure and Applied Mathematics (New York). Wiley, New York (1999); Modern techniques and their applications, A Wiley-Interscience Publication"},{"key":"351_CR6","doi-asserted-by":"crossref","first-page":"420","DOI":"10.1090\/S0002-9947-1968-0220595-7","volume":"131","author":"C.G. Jockusch Jr","year":"1968","unstructured":"Jockusch C.G. Jr: Semirecursive sets and positive reducibility. Trans. Am. Math. Soc. 131, 420\u2013436 (1968)","journal-title":"Trans. Am. Math. Soc."},{"key":"351_CR7","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1002\/malq.19650110104","volume":"11","author":"A.H. Lachlan","year":"1965","unstructured":"Lachlan A.H.: Some notions of reducibility and productiveness. Z. Math. Logik Grundlagen Math. 11, 17\u201344 (1965)","journal-title":"Z. Math. Logik Grundlagen Math."},{"key":"351_CR8","doi-asserted-by":"crossref","first-page":"1362","DOI":"10.2178\/jsl\/1067620192","volume":"68","author":"W. Merkle","year":"2002","unstructured":"Merkle W.: The Kolmogorov\u2013Loveland stochastic sequences are not closed under selecting subsequences. J. Symb. Logic 68, 1362\u20131376 (2002)","journal-title":"J. Symb. Logic"},{"key":"351_CR9","doi-asserted-by":"crossref","unstructured":"Nies, A.: Computability and randomness. In: Oxford Logic Guides, xv + 443. Oxford University Press, Oxford (2009)","DOI":"10.1093\/acprof:oso\/9780199230761.001.0001"},{"key":"351_CR10","volume-title":"Classical Recursion Theory (Volume I)","author":"P. Odifreddi","year":"1989","unstructured":"Odifreddi P.: Classical Recursion Theory (Volume I). North-Holland, Amsterdam (1989)"},{"key":"351_CR11","first-page":"98","volume-title":"Handbook of Computability Theory, Studies in Logic and the Foundations of Mathematics.","author":"P. Odifreddi","year":"1999","unstructured":"Odifreddi P.: Reducibilities. In: Griffor, E.R. (ed.) Handbook of Computability Theory, Studies in Logic and the Foundations of Mathematics., pp. 98\u2013102. Elsevier, Amsterdam (1999)"},{"key":"351_CR12","doi-asserted-by":"crossref","unstructured":"Post, E.: The two-valued iterative systems of mathematical logic. Ann. Math. Stud. 5 (1941)","DOI":"10.1515\/9781400882366"},{"key":"351_CR13","unstructured":"Wang, Y.: Randomness and Complexity. Ph.D. Thesis, University of Heidelberg (1996)"}],"container-title":["Archive for Mathematical Logic"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00153-013-0351-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00153-013-0351-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00153-013-0351-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,23]],"date-time":"2019-07-23T21:33:28Z","timestamp":1563917608000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00153-013-0351-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,9,11]]},"references-count":13,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2014,2]]}},"alternative-id":["351"],"URL":"https:\/\/doi.org\/10.1007\/s00153-013-0351-x","relation":{},"ISSN":["0933-5846","1432-0665"],"issn-type":[{"value":"0933-5846","type":"print"},{"value":"1432-0665","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,9,11]]}}}