Abstract
We develop the theory of index sets in the context of computable analysis considering classes of effectively open sets and computable real-valued functions. First, we construct principal computable numberings for effectively open sets and computable real-valued functions. Then, we calculate the complexity of index sets for important problems such as root realisability, set equivalence and inclusion, function equivalence which naturally arise in continuous constraint solving. Using developed techniques we give a direct proof of the generalised Rice-Shapiro theorem for effectively open sets of Euclidean spaces and present an analogue of Rice’s theorem for computable real-valued functions. We illustrate how index sets can be used to estimate complexity of continuous constraints in the settings of the Kleene-Mostowski arithmetical hierarchy.
This research was partially supported by Marie Curie Int. Research Staff Scheme Fellowship project PIRSES-GA-2011-294962, DFG/RFBR grant CAVER BE 1267/14-1 and 14-01-91334.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Brattka, V., Weihrauch, K.: Computability on subsets of euclidean space I: closed and compact sets. Theor. Comput. Sci. 219(1–2), 65–93 (1999)
Benhamou, F., Goualard, F., Languénou, E., Christie, M.: Interval constraint solving for camera control and motion planning. ACM Trans. Comput. Log. 5(4), 732–767 (2004)
Collins, P.: Continuity and computability of reachable sets. Theor. Comput. Sci. 341(1–3), 162–195 (2005)
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–1432 (2007)
Calvert, W., Harizanov, V.S., Knight, J.F., Miller, S.: Index sets of computable structures. J. Algebra Log. 45(5), 306–325 (2006)
Ershov, Y.L.: Model \(\mathbb{C}\) of partial continuous functionals. In: Proceedings of the Logic Colloquium 76, pp 455–467. North-Holland, Amsterdam (1977)
Ershov, Y.L.: Numbering Theorey. Nauka, Moscow (1977). (in Russian)
Korovina, M.V., Kudinov, O.V.: Positive predicate structures for continuous data. J. Math. Struct. Comput. Sci (2015, To appear). doi:10.1017/S0960129513000315
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–241. Springer, Heidelberg (2010)
Korovina, M.V., Kudinov, O.V.: The uniformity principle for sigma-definability. J. Log. Comput. 19(1), 159–174 (2009)
Korovina, M.V., Kudinov, O.V.: Towards computability over effectively enumerable topological spaces. Electr. Notes Theor. Comput. Sci. 221, 115–125 (2008)
Korovina, M.V., Kudinov, O.V.: Towards computability of higher type continuous data. In: Cooper, S.B., Löwe, B., Torenvliet, L. (eds.) CiE 2005. LNCS, vol. 3526, pp. 235–241. Springer, Heidelberg (2005)
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–344. Springer, Heidelberg (2003)
Korovina, M.V.: Gandy’s theorem for abstract structures without the equality test. In: Vardi, M.Y., Voronkov, A. (eds.) LPAR 2003. LNCS, vol. 2850, pp. 290–301. Springer, Heidelberg (2003)
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–357. Springer, Heidelberg (1993)
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–210. Springer, Heidelberg (2006)
Rogers, H.: Theory of Recursive Functions and Effective Computability. McGraw-Hill, New York (1967)
Shoenfield, J.R.: Degrees of Unsolvability. North-Holland Publ., New York (1971)
Spreen, D.: On r.e. inseparability of CPO index sets. In: Börger, E., Rödding, D., Hasenjaeger, G. (eds.) Rekursive Kombinatorik 1983. LNCS, vol. 171, pp. 103–117. Springer, Heidelberg (1984)
Weihrauch, K.: Computable Analysis. Springer, Berlin (2000)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Korovina, M., Kudinov, O. (2015). Index Sets as a Measure of Continuous Constraint Complexity. In: Voronkov, A., Virbitskaite, I. (eds) Perspectives of System Informatics. PSI 2014. Lecture Notes in Computer Science(), vol 8974. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-46823-4_17
Download citation
DOI: https://doi.org/10.1007/978-3-662-46823-4_17
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-46822-7
Online ISBN: 978-3-662-46823-4
eBook Packages: Computer ScienceComputer Science (R0)