TURING DEGREE SPECTRA OF DIFFERENTIALLY CLOSED FIELDS

DOI10.1017/JSL.2016.73zbMATH Open1419.03039arXiv1406.3637OpenAlexW2963007053MaRDI QIDQ5738187FDOQ5738187

Russell Miller, David Marker

Publication date: 1 June 2017

Published in: Journal of Symbolic Logic (Search for Journal in Brave)

Abstract: 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.

Full work available at URL: https://arxiv.org/abs/1406.3637

zbMATH Keywords

model theorycomputabilitycomputable model theorydifferentially closed fieldsTuring degree spectrum

Mathematics Subject Classification ID

Computable structure theory, computable model theory (03C57) Other Turing degree structures (03D28) Theory of numerations, effectively presented structures (03D45) Differential algebra (12H05) Quantifier elimination, model completeness, and related topics (03C10)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Every Low 2 Boolean Algebra has a Recursive Copy
• Computable Algebra, General Theory and Theory of Computable Fields
• A proof of Vaught's conjecture for \(\omega\)-stable theories
• Computing constraint sets for differential fields
• Recursively presentable prime models
• Computable Boolean algebras
• Jumps of Orderings
• Every Low Boolean Algebra is Isomorphic to a Recursive One
• On algebraic relations between solutions of a generic Painlevé equation
• Degree spectra and computable dimensions in algebraic structures
• Degrees coded in jumps of orderings
• Degrees of Structures
• A COMPUTABLE FUNCTOR FROM GRAPHS TO FIELDS
• Relative to any nonrecursive set
• Enumerations, countable structures and Turing degrees
• On model complete differential fields
• Degrees of orderings not isomorphic to recursive linear orderings
• Spectra of high\(_n\) and non-low\(_n\) degrees
• A Jump Inversion Theorem for the Degree Spectra
• Orderings with αth Jump Degree 0 (α)
• Differential fields

Cited In (7)

• COPYING ONE OF A PAIR OF STRUCTURES
• Punctually presented structures I: Closure theorems
• Comparing Peano arithmetic, Basic Law V, and Hume's Principle
• Computable valued fields
• Rigid differentially closed fields
• Torsion-free abelian groups with optimal Scott families
• Independence in computable algebra

Recommendations

• Title not available (Why is that?) 👍 👎
• Spaces of orders and their Turing degree spectra 👍 👎
• Tchebotarev theorems for function fields 👍 👎
• Degree spectra and computable dimensions in algebraic structures 👍 👎
• On differentially closed ordered fields 👍 👎
• The differential spectrum of a class of power functions over finite fields 👍 👎
• Degree spectra of real closed fields 👍 👎
• The Turing closure of an Archimedean field 👍 👎
• Sets of real numbers closed under Turing equivalence: applications to fields, orders and automorphisms 👍 👎
• Degree spectra for transcendence in fields 👍 👎

This page was built for publication: TURING DEGREE SPECTRA OF DIFFERENTIALLY CLOSED FIELDS

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5738187)