Literature Cited
E. Specker, “Nicht konstruktive bewisbare Sätze der Analysis,” J. Symbolic Logic,14, No. 3, 145–158 (1949).
V. A. Uspenskii, Lectures on Computable Functions [in Russian], Fizmatgiz, Moscow (1960).
A. H. Lachlan and E. W. Madison, “Computable fields and arithmetically definable ordered fields,” Proc. Am. Math. Soc.,24, No. 4, 803–807 (1970).
A. I. Mal'tsev, Algorithms and Recursive Functions [in Russian], Nauka, Moscow (1965).
Yu. L. Ershov, Theory of Numberings [in Russian], Nauka, Moscow (1977).
Yu. L. Ershov, Solvability Problems and Constructive Models [in Russian], Nauka, Moscow (1980).
S. C. Kleene, Introduction to Metamathematics, North-Holland, Amsterdam (1952).
Z. G. Khisamiev, “Computable numberings and equivalence relations,” Sib. Mat. Zh.,27, No. 5, 182–187 (1986).
A. S. Morozov, “On essentially nonconstructivizable groups,” in: Seventh All-Union Conference on Mathematical Logic [in Russian], Novosibirsk (1984), p. 113.
Additional information
Alma-Ata. Translated from Sibirskii Matematicheskii Zhurnal, Vol. 28, No. 5, pp. 193–195, September–October, 1987.
Rights and permissions
About this article
Cite this article
Khisamiev, N.G. Nonconstructivizability of certain ordered fields of real numbers. Sib Math J 28, 845–847 (1987). https://doi.org/10.1007/BF00969332
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF00969332