Ershov, Yu. L. Undecidability of regularly closed fields. (English. Russian original) Zbl 0499.03018 Algebra Logic 20, 257-260 (1982); translation from Algebra Logika 20, 389-394 (1981). Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page Cited in 4 Documents MSC: 03C65 Models of other mathematical theories 03D35 Undecidability and degrees of sets of sentences Keywords:elementary theory of the class of all regularly closed fields PDFBibTeX XMLCite \textit{Yu. L. Ershov}, Algebra Logic 20, 257--260 (1982; Zbl 0499.03018); translation from Algebra Logika 20, 389--394 (1981) Full Text: DOI EuDML References: [1] Yu. L. Ershov, Problems of Decidability and Constructive Models [in Russian], Nauka, Moscow (1980). [2] Yu. L. Ershov, ”Regularly closed fields,” Dokl. Akad. Nauk SSSR,251, No. 4, 783–785 (1980). · Zbl 0467.03026 [3] Yu. L. Ershov, ”On profinite groups,” Algebra Logika,19, No. 5, 552–565 (1980). [4] M. I. Kargapolov and Yu. I. Merzlyakov, Fundamentals of Group Theory [in Russian], 2nd ed., Nauka, Moscow (1977). · Zbl 0499.20001 [5] J. Ax, ”The elementary theory of finite fields,” Ann. Math.,88, 239–271 (1968). · Zbl 0195.05701 · doi:10.2307/1970573 [6] W. C. Waterhouse, ”Profinite groups are Galois groups,” Proc. Am. Math. Soc.,42, No. 2, 639–640 (1974). · Zbl 0281.20031 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. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.