{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T09:03:45Z","timestamp":1750323825613},"publisher-location":"Cham","reference-count":12,"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_23","type":"book-chapter","created":{"date-parts":[[2016,6,13]],"date-time":"2016-06-13T11:34:07Z","timestamp":1465817647000},"page":"225-233","source":"Crossref","is-referenced-by-count":5,"title":["Generalized Effective Reducibility"],"prefix":"10.1007","author":[{"given":"Merlin","family":"Carl","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,6,14]]},"reference":[{"issue":"6","key":"23_CR1","doi-asserted-by":"crossref","first-page":"623","DOI":"10.1016\/j.apal.2011.10.006","volume":"163","author":"V Brattka","year":"2012","unstructured":"Brattka, V., Gherardi, G., Marcone, A.: The Bolzano-Weierstra\u00df theorem is the jump of weak K\u00f6nig\u2019s lemma. Ann. Pure Appl. Log. 163(6), 623\u2013655 (2012)","journal-title":"Ann. Pure Appl. Log."},{"key":"23_CR2","unstructured":"Carl, M.: Approach to a church-turing-thesis for infinitary computations. Preprint. arXiv: 1307.6599"},{"key":"23_CR3","unstructured":"Galeotti, L.: Computable analysis over the generalized Baire space. M.Sc. thesis, Amsterdam (2015)"},{"key":"23_CR4","unstructured":"Gitman, V., Hamkins, J., Johnstone, T.: What is the theory ZFC without power set? Math. Log. Q., Preprint (to appear). arXiv: 1110.2430"},{"key":"23_CR5","unstructured":"Hirschfeldt, D., Jockusch, C.: On notions of computability theoretic reduction between $$\\Pi ^{1}_{2}$$ \u03a0 2 1 -principles. Preprint. http:\/\/www.math.uchicago.edu\/drh\/Papers\/Papers\/upaper.pdf"},{"issue":"2","key":"23_CR6","doi-asserted-by":"crossref","first-page":"567","DOI":"10.2307\/2586556","volume":"65","author":"J Hamkins","year":"2000","unstructured":"Hamkins, J., Lewis, A.: Infinite time turing machines. J. Symb. Log. 65(2), 567\u2013604 (2000)","journal-title":"J. Symb. Log."},{"key":"23_CR7","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1112\/plms\/s3-32.1.133","volume":"32","author":"W Hodges","year":"1976","unstructured":"Hodges, W.: On the effectivity of some field constructions. Proc. London Math. Soc. 32, 133\u2013162 (1976)","journal-title":"Proc. London Math. Soc."},{"key":"23_CR8","volume-title":"Set Theory","author":"T Jech","year":"2003","unstructured":"Jech, T.: Set Theory, Third Millenium edn. Springer, Heidelberg (2003)","edition":"Third Millenium"},{"key":"23_CR9","doi-asserted-by":"crossref","first-page":"377","DOI":"10.2178\/bsl\/1122038993","volume":"11","author":"P Koepke","year":"2005","unstructured":"Koepke, P.: Turing computations on ordinals. Bull. Symb. Log. 11, 377\u2013397 (2005)","journal-title":"Bull. Symb. Log."},{"key":"23_CR10","doi-asserted-by":"crossref","unstructured":"Krantz, S.: The axiom of choice. In: Handbook of Logic and Proof Techniques for Computer Science, pp. 121\u2013126. Birkh\u00e4user, Boston (2002)","DOI":"10.1007\/978-1-4612-0115-1_9"},{"key":"23_CR11","volume-title":"Lecture Notes in Logic","author":"RA Shore","year":"2013","unstructured":"Shore, R.A., Mathematics, R., Countable, U.: Effective mathematics of the uncountable. In: Greenberg, N., Hamkins, J., Hirschfeld, D., Miller, R. (eds.) Lecture Notes in Logic. Cambridge University Press, Cambridge (2013)"},{"key":"23_CR12","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1016\/S0049-237X(09)70519-1","volume":"108","author":"A Zarach","year":"1982","unstructured":"Zarach, A.: Unions of ZF $$^{-}$$ - -models that are themselves ZF $$^{-}$$ - -models. Stud. Logic Found. Math. 108, 315\u2013342 (1982)","journal-title":"Stud. Logic Found. Math."}],"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_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,24]],"date-time":"2017-06-24T12:17:31Z","timestamp":1498306651000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-40189-8_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319401881","9783319401898"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-40189-8_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}