{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T05:01:02Z","timestamp":1725858062844},"publisher-location":"Cham","reference-count":10,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319401881"},{"type":"electronic","value":"9783319401898"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"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":[[2016]]},"DOI":"10.1007\/978-3-319-40189-8_24","type":"book-chapter","created":{"date-parts":[[2016,6,13]],"date-time":"2016-06-13T15:34:07Z","timestamp":1465832047000},"page":"234-239","source":"Crossref","is-referenced-by-count":0,"title":["Lightface $$\\mathop {\\varPi }\\nolimits _{3}^{0}$$ \u03a0 3 0 -Completeness of Density Sets Under Effective Wadge Reducibility"],"prefix":"10.1007","author":[{"given":"Gemma","family":"Carotenuto","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andr\u00e9","family":"Nies","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,6,14]]},"reference":[{"key":"24_CR1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.aim.2012.10.012","volume":"234","author":"A Andretta","year":"2013","unstructured":"Andretta, A., Camerlo, R.: The descriptive set theory of the Lebesgue density theorem. Adv. Math. 234, 1\u201342 (2013)","journal-title":"Adv. Math."},{"key":"24_CR2","doi-asserted-by":"crossref","first-page":"80","DOI":"10.1017\/bsl.2013.3","volume":"20","author":"L Bienvenu","year":"2014","unstructured":"Bienvenu, L., Day, A., Greenberg, N., Ku\u010dera, A., Miller, J., Nies, A., Turetsky, D.: Computing $$K$$ K -trivial sets by incomplete random sets. Bull. Symb. Logic 20, 80\u201390 (2014)","journal-title":"Bull. Symb. Logic"},{"key":"24_CR3","doi-asserted-by":"crossref","first-page":"773","DOI":"10.4171\/JEMS\/602","volume":"18","author":"L Bienvenu","year":"2016","unstructured":"Bienvenu, L., Greenberg, N., Ku\u010dera, A., Nies, A., Turetsky, D.: Coherent randomness tests and computing the K-trivial sets. J. Eur. Math. Soc. 18, 773\u2013812 (2016)","journal-title":"J. Eur. Math. Soc."},{"key":"24_CR4","unstructured":"Carotenuto, C.: On the topological complexity of the density sets of the real line. Ph.D. thesis, Universit\u00e0 di Salerno (2015). http:\/\/elea.unisa.it:8080\/jspui\/bitstream\/10556\/1972\/1\/tesi_G.Carotenuto.pdf"},{"issue":"3","key":"24_CR5","doi-asserted-by":"crossref","first-page":"719","DOI":"10.4310\/MRL.2015.v22.n3.a5","volume":"22","author":"AR Day","year":"2015","unstructured":"Day, A.R., Miller, J.S.: Density, forcing and the covering problem. Math. Res. Lett. 22(3), 719\u2013727 (2015)","journal-title":"Math. Res. Lett."},{"key":"24_CR6","unstructured":"Khan, M.: Lebesgue density and $$\\Pi ^0_1$$ \u03a0 1 0 -classes. J. Symb. Logic, to appear"},{"key":"24_CR7","doi-asserted-by":"crossref","unstructured":"Miyabe, K., Nies, A., Zhang, J.: Using almost-everywhere theorems from analysis to study randomness. Bull. Symb. Logic, (2016, to appear)","DOI":"10.1017\/bsl.2016.10"},{"key":"24_CR8","doi-asserted-by":"crossref","first-page":"1023","DOI":"10.2307\/2274763","volume":"54","author":"F Montagna","year":"1989","unstructured":"Montagna, F., Sorbi, A.: Creativeness and completeness in recursion categories of partial recursive operators. J. Symb. Logic 54, 1023\u20131041 (1989)","journal-title":"J. Symb. Logic"},{"key":"24_CR9","series-title":"Oxford Logic Guides","doi-asserted-by":"crossref","DOI":"10.1093\/acprof:oso\/9780199230761.001.0001","volume-title":"Computability and randomness","author":"A Nies","year":"2009","unstructured":"Nies, A.: Computability and randomness. Oxford Logic Guides, vol. 51. Oxford University Press, Oxford (2009). 444 pp. Paperback version 2011"},{"key":"24_CR10","volume-title":"Classical Recursion Theory","author":"P Odifreddi","year":"1989","unstructured":"Odifreddi, P.: Classical Recursion Theory, vol. 1. NorthHolland Publishing Co., Amsterdam (1989)"}],"container-title":["Lecture Notes in Computer Science","Pursuit of the Universal"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-40189-8_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,24]],"date-time":"2017-06-24T16:17:31Z","timestamp":1498321051000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-40189-8_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319401881","9783319401898"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-40189-8_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}