Structural theory of degrees of unsolvability: advances and open problems

DOI10.1007/s10469-015-9354-5zbMath1361.03039OpenAlexW2233926067WikidataQ128145790 ScholiaQ128145790MaRDI QIDQ904325

Marat M. Arslanov

Publication date: 13 January 2016

Published in: Algebra and Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10469-015-9354-5

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25) Other Turing degree structures (03D28)

Related Items

Turing computability: structural theory

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• An Algebraic Decomposition of the Recursively Enumerable Degrees and the Coincidence of Several Degree Classes with the Promptly Simple Degrees
• On Downey's conjecture
• D.R.E. Degrees and the Nondiamond Theorem
• Lattice embeddings into the recursively enumerable degrees
• Lattice embeddings into the recursively enumerable degrees. II
• Cupping the Recursively Enumerable Degrees by D.R.E. Degrees
• On the existence of a strong minimal pair
• Extension of embeddings in the computably enumerable degrees