{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T04:36:45Z","timestamp":1742963805212,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662468227"},{"type":"electronic","value":"9783662468234"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-662-46823-4_17","type":"book-chapter","created":{"date-parts":[[2015,4,18]],"date-time":"2015-04-18T01:40:54Z","timestamp":1429321254000},"page":"201-215","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Index Sets as a Measure of Continuous Constraint Complexity"],"prefix":"10.1007","author":[{"given":"Margarita","family":"Korovina","sequence":"first","affiliation":[]},{"given":"Oleg","family":"Kudinov","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,4,19]]},"reference":[{"issue":"1\u20132","key":"17_CR1","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1016\/S0304-3975(98)00284-9","volume":"219","author":"V Brattka","year":"1999","unstructured":"Brattka, V., Weihrauch, K.: Computability on subsets of euclidean space I: closed and compact sets. Theor. Comput. Sci. 219(1\u20132), 65\u201393 (1999)","journal-title":"Theor. Comput. Sci."},{"issue":"4","key":"17_CR2","doi-asserted-by":"publisher","first-page":"732","DOI":"10.1145\/1024922.1024927","volume":"5","author":"F Benhamou","year":"2004","unstructured":"Benhamou, F., Goualard, F., Langu\u00e9nou, E., Christie, M.: Interval constraint solving for camera control and motion planning. ACM Trans. Comput. Log. 5(4), 732\u2013767 (2004)","journal-title":"ACM Trans. Comput. Log."},{"issue":"1\u20133","key":"17_CR3","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1016\/j.tcs.2005.05.001","volume":"341","author":"P Collins","year":"2005","unstructured":"Collins, P.: Continuity and computability of reachable sets. Theor. Comput. Sci. 341(1\u20133), 162\u2013195 (2005)","journal-title":"Theor. Comput. Sci."},{"issue":"4","key":"17_CR4","doi-asserted-by":"publisher","first-page":"1418","DOI":"10.2178\/jsl\/1203350796","volume":"72","author":"W Calvert","year":"2007","unstructured":"Calvert, W., Fokina, E., Goncharov, S.S., Knight, J.F., Kudinov, O.V., Morozov, A.S., Puzarenko, V.: Index sets for classes of high rank structures. J. Symb. Log. 72(4), 1418\u20131432 (2007)","journal-title":"J. Symb. Log."},{"issue":"5","key":"17_CR5","doi-asserted-by":"publisher","first-page":"306","DOI":"10.1007\/s10469-006-0029-0","volume":"45","author":"W Calvert","year":"2006","unstructured":"Calvert, W., Harizanov, V.S., Knight, J.F., Miller, S.: Index sets of computable structures. J. Algebra Log. 45(5), 306\u2013325 (2006)","journal-title":"J. Algebra Log."},{"key":"17_CR6","doi-asserted-by":"crossref","unstructured":"Ershov, Y.L.: Model $$\\mathbb{C}$$ of partial continuous functionals. In: Proceedings of the Logic Colloquium 76, pp 455\u2013467. North-Holland, Amsterdam (1977)","DOI":"10.1016\/S0049-237X(09)70439-2"},{"key":"17_CR7","volume-title":"Numbering Theorey","author":"YL Ershov","year":"1977","unstructured":"Ershov, Y.L.: Numbering Theorey. Nauka, Moscow (1977). (in Russian)"},{"key":"17_CR8","doi-asserted-by":"publisher","unstructured":"Korovina, M.V., Kudinov, O.V.: Positive predicate structures for continuous data. J. Math. Struct. Comput. Sci (2015, To appear). doi:10.1017\/S0960129513000315","DOI":"10.1017\/S0960129513000315"},{"key":"17_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1007\/978-3-642-11486-1_20","volume-title":"Perspectives of Systems Informatics","author":"M Korovina","year":"2010","unstructured":"Korovina, M., Kudinov, O.: $$\\varSigma _{K}$$-constraints for hybrid systems. In: Pnueli, A., Virbitskaite, I., Voronkov, A. (eds.) PSI 2009. LNCS, vol. 5947, pp. 230\u2013241. Springer, Heidelberg (2010)"},{"issue":"1","key":"17_CR10","doi-asserted-by":"publisher","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":"17_CR11","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. Electr. Notes Theor. Comput. Sci. 221, 115\u2013125 (2008)","journal-title":"Electr. Notes Theor. Comput. Sci."},{"key":"17_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/11494645_30","volume-title":"New Computational Paradigms","author":"MV Korovina","year":"2005","unstructured":"Korovina, M.V., Kudinov, O.V.: Towards computability of higher type continuous data. In: Cooper, S.B., L\u00f6we, B., Torenvliet, L. (eds.) CiE 2005. LNCS, vol. 3526, pp. 235\u2013241. Springer, Heidelberg (2005)"},{"key":"17_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"330","DOI":"10.1007\/978-3-540-45220-1_27","volume-title":"Computer Science Logic","author":"MV Korovina","year":"2003","unstructured":"Korovina, M.V.: Computational aspects of $$\\varSigma $$-definability over the real numbers without the equality test. In: Baaz, M., Makowsky, J.A. (eds.) CSL 2003. LNCS, vol. 2803, pp. 330\u2013344. Springer, Heidelberg (2003)"},{"key":"17_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"290","DOI":"10.1007\/978-3-540-39813-4_21","volume-title":"LPAR 2003","author":"MV Korovina","year":"2003","unstructured":"Korovina, M.V.: Gandy\u2019s theorem for abstract structures without the equality test. In: Vardi, M.Y., Voronkov, A. (eds.) LPAR 2003. LNCS, vol. 2850, pp. 290\u2013301. Springer, Heidelberg (2003)"},{"key":"17_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1007\/3-540-57318-6_35","volume-title":"HS 1991 and HS 1992","author":"A Nerode","year":"1993","unstructured":"Nerode, A., Kohn, W.: Models for hybrid systems: automata, topologies, controllability, observability. In: Grossman, R.L., Ravn, A.P., Rischel, H., Nerode, A. (eds.) HS 1991 and HS 1992. LNCS, vol. 736, pp. 317\u2013357. Springer, Heidelberg (1993)"},{"key":"17_CR16","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1007\/11856290_18","volume-title":"Artificial Intelligence and Symbolic Computation","author":"S Ratschan","year":"2006","unstructured":"Ratschan, S., She, Z.: Constraints for continuous reachability in the verification of hybrid systems. In: Calmet, J., Ida, T., Wang, D. (eds.) AISC 2006. LNCS (LNAI), vol. 4120, pp. 196\u2013210. Springer, Heidelberg (2006)"},{"key":"17_CR17","volume-title":"Theory of Recursive Functions and Effective Computability","author":"H Rogers","year":"1967","unstructured":"Rogers, H.: Theory of Recursive Functions and Effective Computability. McGraw-Hill, New York (1967)"},{"key":"17_CR18","volume-title":"Degrees of Unsolvability","author":"JR Shoenfield","year":"1971","unstructured":"Shoenfield, J.R.: Degrees of Unsolvability. North-Holland Publ., New York (1971)"},{"key":"17_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1007\/3-540-13331-3_36","volume-title":"Rekursive Kombinatorik 1983","author":"D Spreen","year":"1984","unstructured":"Spreen, D.: On r.e. inseparability of CPO index sets. In: B\u00f6rger, E., R\u00f6dding, D., Hasenjaeger, G. (eds.) Rekursive Kombinatorik 1983. LNCS, vol. 171, pp. 103\u2013117. Springer, Heidelberg (1984)"},{"key":"17_CR20","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, Berlin (2000)"}],"container-title":["Lecture Notes in Computer Science","Perspectives of System Informatics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-46823-4_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,21]],"date-time":"2023-02-21T00:41:49Z","timestamp":1676940109000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-662-46823-4_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783662468227","9783662468234"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-46823-4_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"19 April 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}