{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T05:01:06Z","timestamp":1725858066904},"publisher-location":"Cham","reference-count":13,"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_31","type":"book-chapter","created":{"date-parts":[[2016,6,13]],"date-time":"2016-06-13T15:34:07Z","timestamp":1465832047000},"page":"302-311","source":"Crossref","is-referenced-by-count":0,"title":["On the Lattices of Effectively Open Sets"],"prefix":"10.1007","author":[{"given":"Oleg V.","family":"Kudinov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Victor L.","family":"Selivanov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,6,14]]},"reference":[{"key":"31_CR1","first-page":"1","volume-title":"Handbook of Logic in Computer Science","author":"S Abramsky","year":"1994","unstructured":"Abramsky, S., Jung, A.: Domain theory. In: Abramsky, S., Gabbay, D., Maibaum, T.S.E. (eds.) Handbook of Logic in Computer Science, vol. 3, pp. 1\u2013168. Oxford University Press, Oxford (1994)"},{"issue":"4","key":"31_CR2","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1007\/BF02219096","volume":"11","author":"Y Ershov","year":"1972","unstructured":"Ershov, Y.: Computable functionals of finite types. Algebra Log. 11(4), 367\u2013433 (1972)","journal-title":"Algebra Log."},{"key":"31_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BFb0039696","volume-title":"Formal Methods in Programming and Their Applications","author":"Y Ershov","year":"1993","unstructured":"Ershov, Y.: Theory of domains and nearby. In: Bj\u00f8rner, D., Broy, M., Pottosin, I.V. (eds.) Formal Methods in Programming and Their Applications. LNCS, vol. 735, pp. 1\u20137. Springer, Heidelberg (1993)"},{"key":"31_CR4","doi-asserted-by":"crossref","first-page":"137","DOI":"10.4064\/fm-38-1-137-152","volume":"38","author":"A Grzegorczyk","year":"1951","unstructured":"Grzegorczyk, A.: Undecidability of some topological theories. Fundamenta Mathematicae 38, 137\u2013152 (1951)","journal-title":"Fundamenta Mathematicae"},{"key":"31_CR5","unstructured":"Herrmann, E.: Definable boolean pairs in the lattice of recursively enumerable sets. In: Proceedings of 1st Easter Conference in Model Theory, Diedrichshagen, pp. 42\u201367 (1983)"},{"key":"31_CR6","unstructured":"Herrmann, E.: The undecidability of the elementary theory of the lattice of recursively enumerable sets. In: Proceedings of 2nd Frege Conference at Schwerin, GDR, vol. 20, pp. 66\u201372 (1984)"},{"key":"31_CR7","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1006\/aima.1997.1687","volume":"133","author":"L Harrington","year":"1998","unstructured":"Harrington, L., Nies, A.: Coding in the lattice of enumerable sets. Adv. Math. 133, 133\u2013162 (1998)","journal-title":"Adv. Math."},{"issue":"1","key":"31_CR8","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1093\/logcom\/exn033","volume":"19","author":"MV Korovina","year":"2009","unstructured":"Korovina, M.V., Kudinov, O.V.: The uniformity principle for sigma-definability. J. Log. Comput. 19(1), 159\u2013174 (2009)","journal-title":"J. Log. Comput."},{"key":"31_CR9","doi-asserted-by":"crossref","DOI":"10.1090\/surv\/155","volume-title":"Descriptive Set Theory","author":"YN Moschovakis","year":"2009","unstructured":"Moschovakis, Y.N.: Descriptive Set Theory. North Holland, Amsterdam (2009)"},{"issue":"11","key":"31_CR10","doi-asserted-by":"crossref","first-page":"4989","DOI":"10.1090\/S0002-9947-00-02652-0","volume":"352","author":"A Nies","year":"2000","unstructured":"Nies, A.: Effectively dense Boolean algebras and their applications. Trans. Am. Math. Soc. 352(11), 4989\u20135012 (2000)","journal-title":"Trans. Am. Math. Soc."},{"key":"31_CR11","doi-asserted-by":"crossref","first-page":"258","DOI":"10.1016\/j.tcs.2006.07.053","volume":"365","author":"VL Selivanov","year":"2006","unstructured":"Selivanov, V.L.: Towards a descriptive set theory for domain-like structures. Theoret. Comput. Sci. 365, 258\u2013282 (2006)","journal-title":"Theoret. Comput. Sci."},{"key":"31_CR12","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-02460-7","volume-title":"Recursively Enumerable Sets and Degrees","author":"RI Soare","year":"1987","unstructured":"Soare, R.I.: Recursively Enumerable Sets and Degrees. Springer, Berlin (1987)"},{"key":"31_CR13","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-56999-9","volume-title":"Computable Analysis","author":"K Weihrauch","year":"2000","unstructured":"Weihrauch, K.: Computable Analysis. Springer, Berlin (2000)"}],"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_31","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,9]],"date-time":"2019-09-09T17:45:33Z","timestamp":1568051133000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-40189-8_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319401881","9783319401898"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-40189-8_31","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}