zbMATH — the first resource for mathematics

Analytic definability of constructive real numbers. (English. Russian original) Zbl 0475.03029
Math. Notes 28, 551-556 (1981); translation from Mat. Zametki 28, 177-186 (1980).
03E45 Inner models, including constructibility, ordinal definability, and core models
03E47 Other notions of set-theoretic definability
Full Text: DOI
[1] T. Iekh, Set Theory and the Forcing Method [Russian translation], Mir, Moscow (1973).
[2] V. G. Kanovei, ?Definability using constructivity degrees,? in: Studies in Set Theory and Nonclassical Logic [in Russian], Nauka, Moscow (1976), pp. 5-95.
[3] H. Rogers, Jr., Theory of Recursive Functions and Effective Computability, McGraw-Hill (1967). · Zbl 0183.01401
[4] R. B. Jensen and R. M. Solovay, ?Some applications of almost disjoined sets,? Math. Logic and Foundation of Set Theory, North-Holland, Amsterdam (1970), pp. 84-103.
[5] K. Devlin, ?Aspects of constructibility,? Lect. Notes Math., No. 354, Springer-Verlag, Berlin (1973). · Zbl 0312.02054
[6] V. G. Kanovei, ?Nonemptiness of classes in axiomatic set theory,? Izv. Akad. Nauk SSSR, Ser. Mat.,42, No. 3, 550-579 (1978). · Zbl 0409.03031
[7] R. B. Jensen, ?Definable sets of minimal degree,? Math. Logic and Foundation of Set Theory, North-Holland, Amsterdam (1970), pp. 122-128.
[8] R. B. Jensen and C. Karp, ?Primitive recursive set functions,? Proc. Symp. Pure Math.,13, No. 1, 143-176 (1971).
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.