Degree spectra of real closed fields

Several researchers have recently established that for every Turing degree $$\varvec{c}$$c, the real closed field of all $$\varvec{c}$$c-computable real numbers has spectrum $$ \{ \varvec{d} : \varvec{d}'\ge \varvec{c}'' \} $${d:d′≥c′′}. We investigate the spectra of real closed fields further, focusing first on subfields of the field $$\mathbb {R}_{\varvec{0}}$$R0 of computable real numbers, then on archimedean real closed fields more generally, and finally on non-archimedean real closed fields. For each noncomputable, computably enumerable set C, we produce a real closed C-computable subfield of $$\mathbb {R}_{\varvec{0}}$$R0 with no computable copy. Then we build an archimedean real closed field with no computable copy but with a computable enumeration of the Dedekind cuts it realizes, and a computably presentable nonarchimedean real closed field whose residue field has no computable presentation.

[1]  O. Kudinov,et al.  Spectrum of the Field of Computable Real Numbers , 2017 .

[2]  Carl G. Jockusch,et al.  Every low Boolean algebra is isomorphic to a recursive one , 1994 .

[3]  Valentina S. Harizanov,et al.  Spectra of highn and non-lown degrees , 2012, J. Log. Comput..

[4]  Karen Lange,et al.  Complexity of structures associated with real closed fields , 2013 .

[5]  Eugene W. Madison,et al.  A note on computable real fields , 1970, Journal of Symbolic Logic.

[6]  Robert I. Soare,et al.  Degrees of Orderings Not Isomorphic to Recursive Linear Orderings , 1991, Ann. Pure Appl. Log..

[7]  Linda Jean Richter Degrees of Structures , 1981, Journal of Symbolic Logic.

[8]  C. Jockusch Degrees in Which the Recursive Sets are Uniformly Recursive , 1972, Canadian Journal of Mathematics.

[9]  Richard M. Friedberg,et al.  Three theorems on recursive enumeration. I. Decomposition. II. Maximal set. III. Enumeration without duplication , 1958, Journal of Symbolic Logic.

[10]  Antonio Montalbán,et al.  Computability theoretic classifications for classes of structures , 2014 .

[11]  Julia F. Knight,et al.  Degrees coded in jumps of orderings , 1986, Journal of Symbolic Logic.

[12]  Matthew Harrison-Trainor,et al.  Computable Functors and Effective interpretability , 2017, J. Symb. Log..

[13]  Victor A. Ocasio Computability in the class of Real Closed Fields , 2014 .

[14]  R. Soare Recursively enumerable sets and degrees , 1987 .

[15]  Russell Miller The delta02-Spectrum of A Linear Order , 2001, J. Symb. Log..

[16]  Noam Greenberg,et al.  Generic muchnik reducibility and presentations of fields , 2016 .

[17]  Arkadii M. Slinko,et al.  Degree spectra and computable dimensions in algebraic structures , 2002, Ann. Pure Appl. Log..

[18]  Alexandra Shlapentokh,et al.  A COMPUTABLE FUNCTOR FROM GRAPHS TO FIELDS , 2015, The Journal of Symbolic Logic.