{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:13:10Z","timestamp":1725487990895},"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_14","type":"book-chapter","created":{"date-parts":[[2007,7,24]],"date-time":"2007-07-24T11:16:31Z","timestamp":1185275791000},"page":"135-145","source":"Crossref","is-referenced-by-count":0,"title":["K-Trivial Closed Sets and Continuous Functions"],"prefix":"10.1007","author":[{"given":"George","family":"Barmpalias","sequence":"first","affiliation":[]},{"given":"Douglas","family":"Cenzer","sequence":"additional","affiliation":[]},{"given":"Jeffrey B.","family":"Remmel","sequence":"additional","affiliation":[]},{"given":"Rebecca","family":"Weber","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"14_CR1","unstructured":"Barmpalias, G., Brodhead, P., Cenzer, D., Remmel, J.B., Weber, R.: Algorithmic Randomness of Continuous Functions (in preparation)"},{"key":"14_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/11780342_6","volume-title":"Logical Approaches to Computational Barriers","author":"P. Brodhead","year":"2006","unstructured":"Brodhead, P., Cenzer, D., Dashti, S.: Random closed sets. In: Beckmann, A., Berger, U., L\u00f6we, B., Tucker, J.V. (eds.) CiE 2006. LNCS, vol.\u00a03988, pp. 55\u201364. Springer, Heidelberg (2006)"},{"key":"14_CR3","doi-asserted-by":"crossref","unstructured":"Barmpalias, G., Brodhead, P., Cenzer, D., Dashti, S., Weber, R.: Algorithmic randomness of closed sets, J. Logic and Computation (to appear)","DOI":"10.1093\/logcom\/exm033"},{"key":"14_CR4","series-title":"Electronic Notes in Computer Science","first-page":"79","volume-title":"CCA 2006","author":"P. Brodhead","year":"2006","unstructured":"Brodhead, P., Cenzer, D., Remmel, J.B.: Random continuous functions (Information Berichte, FernUniversit\u00e4t (2006). In: Cenzer, D., Dillhage, R., Grubb, T., Weihrauch, K. (eds.) CCA 2006. Third International Conference on Computability and Complexity in Analysis. Electronic Notes in Computer Science, pp. 79\u201389. Springe, Heidelberg (2006)"},{"key":"14_CR5","unstructured":"Cenzer, D.: $\\Pi^{0}_{1}$ Classes, ASL Lecture Notes in Logic (to appear)"},{"key":"14_CR6","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/0168-0072(93)90001-T","volume":"59","author":"D. Cenzer","year":"1993","unstructured":"Cenzer, D., Downey, R., Jockusch, C.G., Shore, R.: Countable thin $\\Pi^{0}_{1}$ classes. Ann. Pure Appl. Logic\u00a059, 79\u2013139 (1993)","journal-title":"Ann. Pure Appl. Logic"},{"key":"14_CR7","doi-asserted-by":"publisher","first-page":"583","DOI":"10.1007\/s00153-002-0166-7","volume":"42","author":"D. Cenzer","year":"2003","unstructured":"Cenzer, D., Hinman, P.G.: Density of the Medvedev lattice of $\\Pi^0_1$ classes. Archive for Math. Logic\u00a042, 583\u2013600 (2003)","journal-title":"Archive for Math. Logic"},{"key":"14_CR8","doi-asserted-by":"crossref","unstructured":"Cenzer, D., Remmel, J. B.: $\\Pi^0_1$ classes, In: Ersov, Y., Goncharov, S., Marek, V., Nerode, A., Remmel, J. (eds.): Handbook of Recursive Mathematics, Vol. 2: Recursive Algebra, Analysis and Combinatorics, Elsevier Studies in Logic and the Foundations of Mathematics, Vol. 139 pp. 623\u2013821 (1998)","DOI":"10.1016\/S0049-237X(98)80046-3"},{"key":"14_CR9","doi-asserted-by":"publisher","first-page":"357","DOI":"10.4153\/CJM-1958-035-x","volume":"10","author":"J. Dekker","year":"1985","unstructured":"Dekker, J., Myhill, J.: Retraceable sets. Canad. J. Math.\u00a010, 357\u2013373 (1985)","journal-title":"Canad. J. Math."},{"key":"14_CR10","unstructured":"Downey, R.: Five Lectures on Algorithmic Randomness. In: Chong, C.T. (ed.) Computational Prospects of Infinity Proc. 2005 Singapore meeting (to appear 2005)"},{"key":"14_CR11","unstructured":"Downey, R., Hirschfeldt, D.: Algorithmic Randomness and Complexity, in preparation. Current draft available at http:\/\/www.mcs.vuw.ac.nz\/~downey\/ ."},{"key":"14_CR12","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1142\/5186","volume-title":"Proc. 7th and 8th Asian Logic Conference","author":"R. Downey","year":"2003","unstructured":"Downey, R., Hirschfeldt, D., Nies, A., Stephan, F.: Trivial reals. In: Proc. 7th and 8th Asian Logic Conference, pp. 101\u2013131. World Scientific Press, Singapore (2003)"},{"key":"14_CR13","unstructured":"Downey, R.: Some computability-theoretic aspects of reals and randomness. In: Cholak, P. (ed.) The Notre Dame Lectures ASL Lecture Notes in Logic (2005)"},{"key":"14_CR14","doi-asserted-by":"publisher","first-page":"1396","DOI":"10.2307\/2586785","volume":"64","author":"A. Ku\u010dera","year":"1999","unstructured":"Ku\u010dera, A., Terwijn, S.: Lowness for the class of random sets. Journal of Symbolic Logic\u00a064, 1396\u20131402 (1999)","journal-title":"Journal of Symbolic Logic"},{"key":"14_CR15","doi-asserted-by":"publisher","first-page":"274","DOI":"10.1016\/j.aim.2004.10.006","volume":"197","author":"A. Nies","year":"2005","unstructured":"Nies, A.: Lowness properties and randomness. Advances in Mathematics\u00a0197, 274\u2013305 (2005)","journal-title":"Advances in Mathematics"},{"key":"14_CR16","unstructured":"Nies, A.: Computability and Randomness, in preparation. Current draft available at http:\/\/www.cs.auckland.ac.nz\/~nies ."},{"key":"14_CR17","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1305\/ndjfl\/1093957732","volume":"5","author":"K. Ohashi","year":"1964","unstructured":"Ohashi, K.: A stronger form of a theorem of Friedberg. Notre Dame J. Formal Logic\u00a05, 10\u201312 (1964)","journal-title":"Notre Dame J. Formal Logic"},{"key":"14_CR18","doi-asserted-by":"publisher","first-page":"1","DOI":"10.2178\/bsl\/1107959497","volume":"11","author":"S.G. Simpson","year":"2005","unstructured":"Simpson, S.G.: Mass problems and randomness. Bull. Symbolic Logic\u00a011, 1\u201327 (2005)","journal-title":"Bull. Symbolic Logic"}],"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_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T08:18:14Z","timestamp":1556698694000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-73001-9_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540730002","9783540730019"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-73001-9_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2007]]}}}