Sets of degrees of computable fields
Given a Σ2 (resp. Σ1) degree of recursive unsolvability a, a computable field (resp. a computable field with a splitting algorithm)F is constructed in any given characteristic, such that the set of dimensions of all finite extensions ofF has degree a.
Unable to display preview. Download preview PDF.
- 3.Ju. L. Ershov,Constructive models, inSelected Questions of Algebra and Logic, Nauka, Novosibirsk, 1973, pp. 111–130 (Russian).Google Scholar
- 4.Basil Gordon and E. G. Straus,On the degrees of the finite extensions of a field, in Proc. Symp. Pure Math., Vol VIII, Amer. Math. Soc., Providence, R.I., 1965, pp. 56–65.Google Scholar
- 6.B. L. van der Waerden,Modern Algebra, Vol. I, New York, Ungar, 1949.Google Scholar