Skip to main content Accesibility Help

Positive predicate structures for continuous data


In this paper, we develop a general framework for continuous data representations using positive predicate structures. We first show that basic principles of Σ-definability which are used to investigate computability, i.e., existence of a universal Σ-predicate and an algorithmic characterization of Σ-definability hold on all predicate structures without equality. Then we introduce positive predicate structures and show connections between these structures and effectively enumerable topological spaces. These links allow us to study computability over continuous data using logical and topological tools.

Hide All

This research was partially supported by EU project PIRSES-GA-2011-294962, grants DFG/RFBR 1267/14-1, 14-01-91334 and RFBR 13-01-0015_a.

Hide All
Ajtai, M. (1989) First-order definability on finite structures. Annals of Pure and Applied Logic 45 211225.
Barwise, J. (1975) Admissible Sets and Structures. Springer Verlag.
Brattka, V. and Presser, G. (2003) Computability on subsets of metric spaces. Theoretical Computer Science 305 (1–3) 4376.
Ershov, Y. L. (1996) Definability and Computability. Plenum, New York.
Grübba, T., Schröder, M. and Weihrauch, K. (2007) Computable metrization. Mathematical Logic Quaterly 53 (4–5) 595604.
Hodges, W. (1993) The meaning of specifications: Set-theoretical specification. Semantics of Programming Languages and Model Theory, Algebra, Logic and Applications Series 5 4368.
Immerman, N. (1999) Descriptive Complexity. Springer Verlag.
Korovina, M. (2003) Gandy's theorem for abstract structures without the equality test. In: Vardi, Y. M. and Voronkov, A. (eds.) LPAR'03, Springer Lecture Notes in Computer Science 2850 290301.
Korovina, M. (2003) Computational aspects of Σ-definability over the real numbers without the equality test. In: Baaz, M. and Makowsky, J. A. (eds.) CSL'03, Springer Lecture Notes in Computer Science 2803 330344.
Korovina, M. and Kudinov, O. (2005) Towards computability of higher type continuous data. In: Cooper, S. B., Löwe, B. and Torenvliet, L. (eds) CiE'05, Springer Lecture Notes in Computer Science 3526 235241.
Korovina, M. and Kudinov, O. (2007) The uniformity principle for Σ-definability with applications to computable analysis. In: Cooper, S. B., Löwe, B. and Sorbi, A. (eds.) CiE'07, Springer Lecture Notes in Computer Science 4497 416425.
Korovina, M. and Kudinov, O. (2008) Towards Computability over Effectively Enumerable Topological Spaces. Elsevier Electronic Notes in Theoretical Computer Science 221 115125.
Morozov, A. and Korovina, M. (2008) On Σ-definability without equality over the real numbers. Mathematical Logic Quarterly 54 (5) 535544.
Moschovakis, Y. N. (1969) Abstract first order computability I, II. Transactions of the American Mathematical Society 138 427504.
Moschovakis, Y. N. (1974) Elementary induction on abstract structures. Studies in Logic and the Foundations of Mathematics volume 77, North-Holland.
Moschovakis, Y. N. (1976) Recursive metric spaces. Fundamenta Mathematicae 55 215238.
Sazonov, V. (2001) Using agents for concurrent querying of web-like databases via hyper-set-theoretic approach. In: Bjørner, D., Broy, M. and Zamulin, A. V. (eds.) PSI'01, Springer Lecture Notes in Computer Science 2244 378394.
Weihrauch, K. (1993) Computability on computable metric spaces. Theoretical Computer Science 113 191210.
Weihrauch, K. (2000) Computable Analysis. Springer Verlag.
Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

Mathematical Structures in Computer Science
  • ISSN: 0960-1295
  • EISSN: 1469-8072
  • URL: /core/journals/mathematical-structures-in-computer-science
Please enter your name
Please enter a valid email address
Who would you like to send this to? *


Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed