Turing degree spectra of differentially Closed Fields

The degree spectrum of a countable structure is the set of all Turing degrees of presentations of that structure. We show that every nonlow Turing degree lies in the spectrum of some differentially closed field (of characteristic 0, with a single derivation) whose spectrum does not contain the computable degree 0. Indeed, this is an equivalence, for we also show that every such field of low degree is isomorphic to a computable differential field. Relativizing the latter result and applying a theorem of Montalban, Soskova, and Soskov, we conclude that the spectra of countable differentially closed fields of characteristic 0 are exactly the jump-preimages of spectra of automorphically nontrivial countable graphs.

[1]  Saharon Shelah,et al.  A proof of vaught’s conjecture forω-stable theories , 1984 .

[2]  Stephan Wehner.  Enumerations, countable structures and Turing degrees , 1998 .

[3]  M. Rabin.  Computable algebra, general theory and theory of computable fields. , 1960 .

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

[5]  Angus D. Macintyre.  Connections between model theory and algebraic and analytic geometry , 2000 .

[6]  Theodore A. Slaman.  Relative to any nonrecursive set , 1998 .

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

[8]  Anand Pillay,et al.  Differential Algebraic Groups and the Number of Countable Differentially Closed Fields , 2005 .

[9]  J. Ritt,et al.  Differential Equations from the Algebraic Standpoint , 1933, Nature.

[10]  Rodney G. Downey,et al.  Orderings with th jump degree 0 , 1992 .

[11]  Ehud Hrushovski,et al.  On model complete differential fields , 2003 .

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

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

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

[15]  Alexandra A. Soskova.  A Jump Inversion Theorem for the Degree Spectra , 2007, CiE.

[16]  Anand Pillay,et al.  On algebraic relations between solutions of a generic Painleve equation , 2011, 1112.2916.

[17]  Leo Harrington.  Recursively Presentable Prime Models , 1974, J. Symb. Log..

[18]  J. Thurber.  Every Low 2 Boolean Algebra has a Recursive Copy , 1995 .

[19]  Christopher J. Ash,et al.  Jumps of orderings , 1990 .

[20]  Gerald E. Sacks.  Saturated Model Theory , 1972 .

[21]  Michael Stob,et al.  Computable Boolean algebras , 2000, Journal of Symbolic Logic.

[22]  Antonio Montalb An.  NOTES ON THE JUMP OF A STRUCTURES , 2009 .

[23]  Alexey Ovchinnikov,et al.  Computing constraint sets for differential fields , 2012, 1208.1152.

[24]  Antonio Montalbán.  Notes on the Jump of a Structure , 2009, CiE.

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

[26]  L. Blum,et al.  Generalized algebraic theories : a model theorectic approach, , 1968 .

[27]  Lenore Blum.  Differentially closed fields: a model-theoretic tour , 1977 .

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

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