TURING DEGREE SPECTRA OF DIFFERENTIALLY CLOSED FIELDS
From MaRDI portal
Publication:5738187
DOI10.1017/jsl.2016.73zbMath1419.03039arXiv1406.3637OpenAlexW2963007053MaRDI QIDQ5738187
David Marker, Russell G. Miller
Publication date: 1 June 2017
Published in: The Journal of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1406.3637
Differential algebra (12H05) Computable structure theory, computable model theory (03C57) Theory of numerations, effectively presented structures (03D45) Other Turing degree structures (03D28) Quantifier elimination, model completeness, and related topics (03C10)
Related Items
Torsion-free abelian groups with optimal Scott families ⋮ Computable valued fields ⋮ COPYING ONE OF A PAIR OF STRUCTURES ⋮ Punctually presented structures I: Closure theorems ⋮ Comparing Peano arithmetic, Basic Law V, and Hume's Principle ⋮ Independence in computable algebra
Cites Work
- Computing constraint sets for differential fields
- On algebraic relations between solutions of a generic Painlevé equation
- Degrees of orderings not isomorphic to recursive linear orderings
- A proof of Vaught's conjecture for \(\omega\)-stable theories
- Degree spectra and computable dimensions in algebraic structures
- Computable Boolean algebras
- Spectra of highn and non-lown degrees
- Jumps of Orderings
- A Jump Inversion Theorem for the Degree Spectra
- Degrees coded in jumps of orderings
- Orderings with αth Jump Degree 0 (α)
- Recursively presentable prime models
- Every Low Boolean Algebra is Isomorphic to a Recursive One
- Relative to any nonrecursive set
- Enumerations, countable structures and Turing degrees
- On model complete differential fields
- A COMPUTABLE FUNCTOR FROM GRAPHS TO FIELDS
- Degrees of Structures
- Every Low 2 Boolean Algebra has a Recursive Copy
- Computable Algebra, General Theory and Theory of Computable Fields
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
