Computational Aspects of sigma-Definability over the Real Numbers without the Equality Test

In this paper we study the expressive power and algorithmic properties of the language of Σ-formulas intended to represent computability over the real numbers. In order to adequately represent computability, we extend the reals by the structure of hereditarily finite sets. In this setting it is crucial to consider the real numbers without equality since the equality test is undecidable over the reals. We prove Engeler’s Lemma for Σ-definability over the reals without the equality test which relates Σ-definability with definability in the constructive infinitary language \(L_{\omega_1\omega}\). Thus, a relation over the real numbers is Σ-definable if and only if it is definable by a disjunction of a recursively enumerable set of quantifier free formulas. This result reveals computational aspects of Σ-definability and also gives topological characterisation of Σ-definable relations over the reals without the equality test.

[1]  J. V. Tucker,et al.  Projections of Semicomputable Relations on Abstract Data Tzpes , 1991, Int. J. Found. Comput. Sci..

[2]  Margarita V. Korovina,et al.  Fixed Points on the Real Numbers without the Equality Test , 2002, CCA.

[3]  Ulrich Kohlenbach,et al.  Proof theory and computational analysis , 1997, COMPROX.

[4]  Ker-I Ko,et al.  Computational Complexity of Real Functions , 1982, Theor. Comput. Sci..

[5]  Andreas Blass,et al.  Background, Reserve, and Gandy Machines , 2000, CSL.

[6]  Alex K. Simpson,et al.  Computational Adequacy in an Elementary Topos , 1998, CSL.

[7]  I︠U︡riĭ Leonidovich Ershov.  Definability and Computability , 1996 .

[8]  Johann A. Makowsky,et al.  Query Languages for Hierarchic Databases , 1992, Inf. Comput..

[9]  Marie-Françoise Roy,et al.  Real algebraic geometry , 1992 .

[10]  Vladimir Yu. Sazonov,et al.  Using Agents for Concurrent Querying of Web-Like Databases via a Hyper-Set-Theoretic Approach , 2001, Ershov Memorial Conference.

[11]  Margarita V. Korovina,et al.  Recent Advances in S-Definability over Continuous Data Types , 2003, Ershov Memorial Conference.

[12]  Lenore Blum,et al.  Complexity and Real Computation , 1997, Springer New York.

[13]  Erwin Engeler,et al.  Formal languages; automata and structures , 1968 .

[14]  Yiannis N. Moschovakis,et al.  Elementary induction on abstract structures , 1974 .

[15]  Jerzy Tiuryn,et al.  Dynamic logic , 2001, SIGA.

[16]  Manfred Broy,et al.  Perspectives of System Informatics , 2001, Lecture Notes in Computer Science.

[17]  Miklós Ajtai,et al.  First-Order Definability on Finite Structures , 1989, Ann. Pure Appl. Log..

[18]  Jörg Flum,et al.  Finite model theory , 1995, Perspectives in Mathematical Logic.

[19]  Marian Boykan Pour-El,et al.  Computability in analysis and physics , 1989, Perspectives in Mathematical Logic.

[20]  Oleg V. Kudinov,et al.  Characteristic Properties of Majorant-Computability over the Reals , 1998, CSL.

[21]  Jon Barwise,et al.  Admissible sets and structures , 1975 .

[22]  Erwin Engeler,et al.  Languages with expressions of infinite length , 1966 .

[23]  Klaus Weihrauch,et al.  Computable Analysis: An Introduction , 2014, Texts in Theoretical Computer Science. An EATCS Series.

[24]  Yiannis N. Moschovakis,et al.  Abstract first order computability. II , 1969 .