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

DOI10.1134/S0081543812070024zbMATH Open1361.03038OpenAlexW1977051128WikidataQ128145824 ScholiaQ128145824MaRDI QIDQ744306FDOQ744306

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

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

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)