{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,27]],"date-time":"2026-03-27T05:48:54Z","timestamp":1774590534751,"version":"3.50.1"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030232467","type":"print"},{"value":"9783030232474","type":"electronic"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-23247-4_13","type":"book-chapter","created":{"date-parts":[[2019,7,7]],"date-time":"2019-07-07T23:02:38Z","timestamp":1562540558000},"page":"171-183","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["Computability on Quasi-Polish Spaces"],"prefix":"10.1007","author":[{"given":"Mathieu","family":"Hoyrup","sequence":"first","affiliation":[]},{"given":"Crist\u00f3bal","family":"Rojas","sequence":"additional","affiliation":[]},{"given":"Victor","family":"Selivanov","sequence":"additional","affiliation":[]},{"given":"Donald M.","family":"Stull","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,6,25]]},"reference":[{"key":"13_CR1","volume-title":"Handbook of Logic in Computer Science","author":"S Abramsky","year":"1994","unstructured":"Abramsky, S.: Domain theory. In: Abramsky, S., Gabbay, D., Maibaum, T.S.E. (eds.) Handbook of Logic in Computer Science. Clarendon Press, Oxford (1994)"},{"issue":"7","key":"13_CR2","doi-asserted-by":"publisher","first-page":"1490","DOI":"10.1017\/S096012951300025X","volume":"25","author":"V Becher","year":"2015","unstructured":"Becher, V., Grigorieff, S.: Borel and Hausdorff hierarchies in topological spaces of choquet games and their effectivization. Math. Struct. Comput. Sci. 25(7), 1490\u20131519 (2015). https:\/\/doi.org\/10.1017\/S096012951300025X","journal-title":"Math. Struct. Comput. Sci."},{"issue":"3","key":"13_CR3","doi-asserted-by":"publisher","first-page":"356","DOI":"10.1016\/j.apal.2012.11.001","volume":"164","author":"M de Brecht","year":"2013","unstructured":"de Brecht, M.: Quasi-polish spaces. Ann. Pure Appl. Logic 164(3), 356\u2013381 (2013)","journal-title":"Ann. Pure Appl. Logic"},{"key":"13_CR4","unstructured":"Brecht de, M., Pauly, A., Schr\u00f6der, M.: Overt choice. CoRR abs\/1902.05926 (2019). http:\/\/arxiv.org\/abs\/1902.05926"},{"key":"13_CR5","unstructured":"Chen, R.: Notes on quasi-Polish spaces. CoRR abs\/1902.05926 (2018). http:\/\/arxiv.org\/abs\/1809.07440"},{"key":"13_CR6","volume-title":"Invariant Descriptive Set Theory","author":"S Gao","year":"2009","unstructured":"Gao, S.: Invariant Descriptive Set Theory. CRC Press, New York (2009)"},{"key":"13_CR7","doi-asserted-by":"publisher","unstructured":"Gregoriades, V.: Classes of polish spaces under effective Borel isomorphism. Mem. Amer. Math. Soc. 240(1135) (2016). https:\/\/doi.org\/10.1090\/memo\/1135","DOI":"10.1090\/memo\/1135"},{"issue":"8","key":"13_CR8","doi-asserted-by":"publisher","first-page":"1414","DOI":"10.1017\/S0960129516000128","volume":"27","author":"V Gregoriades","year":"2017","unstructured":"Gregoriades, V., Kisp\u00e9ter, T., Pauly, A.: A comparison of concepts from computable analysis and effective descriptive set theory. Math. Struct. Comput. Sci. 27(8), 1414\u20131436 (2017). https:\/\/doi.org\/10.1017\/S0960129516000128","journal-title":"Math. Struct. Comput. Sci."},{"issue":"4\u20135","key":"13_CR9","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1002\/malq.200710009","volume":"53","author":"T Grubba","year":"2007","unstructured":"Grubba, T., Schr\u00f6der, M., Weihrauch, K.: Computable metrization. MLQ Math. Log. Q. 53(4\u20135), 381\u2013395 (2007). https:\/\/doi.org\/10.1002\/malq.200710009","journal-title":"MLQ Math. Log. Q."},{"key":"13_CR10","doi-asserted-by":"publisher","unstructured":"Hoyrup, M.: Genericity of weakly computable objects. Theory Comput. Syst.60(3), 396\u2013420 (2017). https:\/\/doi.org\/10.1007\/s00224-016-9737-6","DOI":"10.1007\/s00224-016-9737-6"},{"key":"13_CR11","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-4190-4","volume-title":"Classical Descriptive Set Theory, GTM","author":"AS Kechris","year":"1995","unstructured":"Kechris, A.S.: Classical Descriptive Set Theory, GTM, vol. 156. Springer, New York (1995). https:\/\/doi.org\/10.1007\/978-1-4612-4190-4"},{"key":"13_CR12","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/j.entcs.2008.12.011","volume":"221","author":"MV Korovina","year":"2008","unstructured":"Korovina, M.V., Kudinov, O.V.: Towards computability over effectively enumerable topological spaces. Electron. Notes Theor. Comput. Sci. 221, 115\u2013125 (2008). https:\/\/doi.org\/10.1016\/j.entcs.2008.12.011","journal-title":"Electron. Notes Theor. Comput. Sci."},{"key":"13_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"282","DOI":"10.1007\/978-3-319-58741-7_27","volume-title":"Unveiling Dynamics and Complexity","author":"M Korovina","year":"2017","unstructured":"Korovina, M., Kudinov, O.: On higher effective descriptive set theory. In: Kari, J., Manea, F., Petre, I. (eds.) CiE 2017. LNCS, vol. 10307, pp. 282\u2013291. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-58741-7_27"},{"key":"13_CR14","series-title":"Lecture Notes in Mathematics","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1007\/BFb0103106","volume-title":"Higher Set Theory","author":"A Louveau","year":"1978","unstructured":"Louveau, A.: Recursivity and compactness. In: M\u00fcller, G.H., Scott, D.S. (eds.) Higher Set Theory. LNM, vol. 669, pp. 303\u2013337. Springer, Heidelberg (1978). https:\/\/doi.org\/10.1007\/BFb0103106"},{"key":"13_CR15","doi-asserted-by":"crossref","unstructured":"Moschovakis, Y.N.: Descriptive Set Theory. Mathematical Surveys and Monographs, Second edition. American Mathematical Society (2009). http:\/\/www.math.ucla.edu\/~ynm\/lectures\/dst2009\/dst2009.pdf","DOI":"10.1090\/surv\/155"},{"key":"13_CR16","unstructured":"Rogers Jr., H.: Theory of Recursive Functions and Effective Computability. MIT Press, Cambridge (1987). https:\/\/mitpress.mit.edu\/books\/theory-recursive-functions-and-effective-computability. (Reprint from 1967)"},{"key":"13_CR17","first-page":"135","volume":"2","author":"V Selivanov","year":"1982","unstructured":"Selivanov, V.: On index sets in the Kleene-Mostowski hierarchy. Trans. Inst. Math. 2, 135\u2013158 (1982). in Russian","journal-title":"Trans. Inst. Math."},{"key":"13_CR18","doi-asserted-by":"publisher","unstructured":"Selivanov, V.L.: Towards a descriptive set theory for domain-like structures. Theoret. Comput. Sci. 365(3), 258\u2013282 (2006). https:\/\/doi.org\/10.1016\/j.tcs.2006.07.053","DOI":"10.1016\/j.tcs.2006.07.053"},{"key":"13_CR19","doi-asserted-by":"publisher","unstructured":"Selivanov, V.L.: On the difference hierarchy in countably based T$${}_{\\text{0}}$$-spaces. Electron. Notes Theor. Comput. Sci. 221, 257\u2013269 (2008). https:\/\/doi.org\/10.1016\/j.entcs.2008.12.022","DOI":"10.1016\/j.entcs.2008.12.022"},{"key":"13_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"324","DOI":"10.1007\/978-3-319-20028-6_33","volume-title":"Evolving Computability","author":"V Selivanov","year":"2015","unstructured":"Selivanov, V.: Towards the effective descriptive set theory. In: Beckmann, A., Mitrana, V., Soskova, M. (eds.) CiE 2015. LNCS, vol. 9136, pp. 324\u2013333. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-20028-6_33"},{"key":"13_CR21","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-56999-9","volume-title":"Computable Analysis","author":"K Weihrauch","year":"2000","unstructured":"Weihrauch, K.: Computable Analysis. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/978-3-642-56999-9"}],"container-title":["Lecture Notes in Computer Science","Descriptional Complexity of Formal Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-23247-4_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,12]],"date-time":"2025-02-12T06:51:14Z","timestamp":1739343074000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-23247-4_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030232467","9783030232474"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-23247-4_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"25 June 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"DCFS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Descriptional Complexity of Formal Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Ko\u0161ice","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Slovakia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 July 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 July 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dcfs2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/im.saske.sk\/dcfs2019\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"25","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"18","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"72% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3,1","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2,9","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"there are also 4 invited talks","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}