Model-theoretic properties of Turing degrees in the Ershov difference hierarchy

DOI10.1134/S0081543812070024zbMath1361.03038OpenAlexW1977051128WikidataQ128145824 ScholiaQ128145824MaRDI QIDQ744306

Marat M. Arslanov

Publication date: 7 October 2014

Published in: Proceedings of the Steklov Institute of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s0081543812070024

Mathematics Subject Classification ID

Other degrees and reducibilities in computability and recursion theory (03D30) Other Turing degree structures (03D28) Hierarchies of computability and definability (03D55)

Related Items (1)

On the problem of definability of the computably enumerable degrees in the difference hierarchy

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Splitting in 2-computably enumerable degrees with avoiding cones
• The elementary theory of the recursively enumerable degrees is not \(\aleph _ 0\)-categorical
• Definability in the Turing degrees
• The d.r.e. degrees are not dense
• The elementary theory of recursively enumerable sets
• Interpolation and embedding in the recursively enumerable degrees
• A splitting theorem for $n-REA$ degrees
• On Σ₁-Structural Differences Among Finite Levels of the Ershov Hierarchy
• On Downey's conjecture
• D.R.E. Degrees and the Nondiamond Theorem
• Finitely Generated Codings and the Degrees R.E. in a Degree d
• A Splitting Theorem for the N-R.E. Degrees
• A recursively enumerable degree which will not split over all lesser ones
• Algebraic aspects of the computably enumerable degrees.
• Turing Definability in the Ershov Hierarchy
• Degrees of Unsolvability. (AM-55)
• Lower Bounds for Pairs of Recursively Enumerable Degrees
• Trial and error predicates and the solution to a problem of Mostowski
• Limiting recursion
• Hierarchies of Boolean algebras
• New Computational Paradigms
• Extension of embeddings in the computably enumerable degrees

This page was built for publication: Model-theoretic properties of Turing degrees in the Ershov difference hierarchy