{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T05:24:37Z","timestamp":1725686677523},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642308697"},{"type":"electronic","value":"9783642308703"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-30870-3_14","type":"book-chapter","created":{"date-parts":[[2012,5,28]],"date-time":"2012-05-28T02:56:12Z","timestamp":1338173772000},"page":"129-138","source":"Crossref","is-referenced-by-count":0,"title":["On Mathias Generic Sets"],"prefix":"10.1007","author":[{"given":"Peter A.","family":"Cholak","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Damir D.","family":"Dzhafarov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jeffry L.","family":"Hirst","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"14_CR1","doi-asserted-by":"publisher","first-page":"119","DOI":"10.2178\/jsl\/1140641165","volume":"71","author":"S. Binns","year":"2006","unstructured":"Binns, S., Kjos-Hanssen, B., Lerman, M., Solomon, R.: On a conjecture of Dobrinen and Simpson concerning almost everywhere domination. J. Symbolic Logic\u00a071, 119\u2013136 (2006)","journal-title":"J. Symbolic Logic"},{"key":"14_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.2307\/2694910","volume":"66","author":"P.A. Cholak","year":"2001","unstructured":"Cholak, P.A., Jockusch Jr., C.G., Slaman, T.A.: On the strength of Ramsey\u2019s theorem for pairs. J. Symbolic Logic\u00a066, 1\u201355 (2001)","journal-title":"J. Symbolic Logic"},{"key":"14_CR3","series-title":"Theory and Applications of Computability","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-68441-3","volume-title":"Algorithmic randomness and complexity","author":"R.G. Downey","year":"2010","unstructured":"Downey, R.G., Hirschfeldt, D.R.: Algorithmic randomness and complexity. Theory and Applications of Computability. Springer, New York (2010)"},{"key":"14_CR4","doi-asserted-by":"publisher","first-page":"557","DOI":"10.2178\/jsl\/1243948327","volume":"74","author":"D.D. Dzhafarov","year":"2009","unstructured":"Dzhafarov, D.D., Jockusch Jr., C.G.: Ramsey\u2019s theorem and cone avoidance. J. Symbolic Logic\u00a074, 557\u2013578 (2009)","journal-title":"J. Symbolic Logic"},{"key":"14_CR5","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1002\/malq.19690150707","volume":"15","author":"C.G. Jockusch Jr.","year":"1969","unstructured":"Jockusch Jr., C.G.: The degrees of bi-immune sets. Z. Math. Logik Grundlagen Math.\u00a015, 135\u2013140 (1969)","journal-title":"Z. Math. Logik Grundlagen Math."},{"key":"14_CR6","series-title":"London Math. Soc. Lecture Note Ser.","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1017\/CBO9780511629181.004","volume-title":"Recursion Theory: its Generalisation and Applications","author":"C.G. Jockusch Jr.","year":"1980","unstructured":"Jockusch Jr., C.G.: Degrees of generic sets. In: Drake, F.R., Wainer, S.S. (eds.) Recursion Theory: its Generalisation and Applications. London Math. Soc. Lecture Note Ser., vol.\u00a045, pp. 110\u2013139. Cambridge University Press, Cambridge (1980)"},{"key":"14_CR7","doi-asserted-by":"publisher","first-page":"715","DOI":"10.2307\/2273510","volume":"43","author":"C.G. Jockusch Jr.","year":"1978","unstructured":"Jockusch Jr., C.G., Posner, D.B.: Double jumps of minimal degrees. J. Symbolic Logic\u00a043, 715\u2013724 (1978)","journal-title":"J. Symbolic Logic"},{"key":"14_CR8","doi-asserted-by":"publisher","first-page":"764","DOI":"10.2307\/2273469","volume":"48","author":"S.A. Kurtz","year":"1983","unstructured":"Kurtz, S.A.: Notions of weak genericity. J. Symbolic Logic\u00a048, 764\u2013770 (1983)","journal-title":"J. Symbolic Logic"},{"key":"14_CR9","first-page":"570","volume":"36","author":"D. Seetapun","year":"1995","unstructured":"Seetapun, D., Slaman, T.A.: On the strength of Ramsey\u2019s theorem. Special Issue: Models of arithmetic. Notre Dame J. Formal Logic\u00a036, 570\u2013582 (1995)","journal-title":"Special Issue: Models of arithmetic. Notre Dame J. Formal Logic"},{"key":"14_CR10","series-title":"Theory and Applications of Computability","volume-title":"Computability theory and applications","author":"R.I. Soare","year":"2012","unstructured":"Soare, R.I.: Computability theory and applications. Theory and Applications of Computability. Springer, New York (2012)"},{"key":"14_CR11","doi-asserted-by":"publisher","first-page":"53","DOI":"10.2307\/2270981","volume":"34","author":"R.I. Soare","year":"1969","unstructured":"Soare, R.I.: Sets with no subset of higher degree. J. Symbolic Logic\u00a034, 53\u201356 (1969)","journal-title":"J. Symbolic Logic"},{"key":"14_CR12","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1007\/s00153-005-0306-y","volume":"45","author":"L. Yu","year":"2006","unstructured":"Yu, L.: Lowness for genericity. Arch. Math. Logic\u00a045, 233\u2013238 (2006)","journal-title":"Arch. Math. Logic"}],"container-title":["Lecture Notes in Computer Science","How the World Computes"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-30870-3_14.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T11:32:18Z","timestamp":1620127938000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-30870-3_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642308697","9783642308703"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-30870-3_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}