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

DOI10.1134/S0081543812070024MaRDI QIDQ744306zbMATH OpenOpenAlexWikidataFDO

Authors M. 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 Turing degree structures (03D28) Hierarchies of computability and definability (03D55) Other degrees and reducibilities in computability and recursion theory (03D30)

Cites work

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

Cited in

(1)

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

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

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