论文信息 - On Σ‐definability without equality over the real numbers - 字舞流文

On Σ‐definability without equality over the real numbers

Andrei S. Morozov | Margarita V. Korovina | A. Morozov | M. Korovina

[1] Oleg V. Kudinov,et al. The Uniformity Principle for Sigma -Definability with Applications to Computable Analysis , 2007, CiE.

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

[3] Margarita V. Korovina. Recent Advances in Σ-definability over Continuous Data Types , 2003 .

[4] J. V. Tucker,et al. Computable functions and semicomputable sets on many-sorted algebras , 2001, Logic in Computer Science.

[5] Oleg V. Kudinov,et al. Semantic Characterisations of Second-Order Computability over the Real Numbers , 2001, CSL.

[6] G. Sacks. A DECISION METHOD FOR ELEMENTARY ALGEBRA AND GEOMETRY , 2003 .

[7] Margarita V. Korovina,et al. Computational Aspects of sigma-Definability over the Real Numbers without the Equality Test , 2003, CSL.

[8] P. Boldi,et al. δ-uniform BSS Machines , 1998 .

[9] Ning Zhong. Recursively Enumerable Subsets of Rq in Two Computing Models: Blum-Shub-Smale Machine and Turing Machine , 1998, Theor. Comput. Sci..

[10] Wilfrid Hodges,et al. The meaning of specifications II: set-theoretic specification , 1993 .

[11] Sebastiano Vigna,et al. Equality is a Jump , 1999, Theor. Comput. Sci..