A superhigh diamond in the c.e. tt-degrees

DOI10.1007/s00153-010-0198-3zbMath1216.03054OpenAlexW1984427327MaRDI QIDQ627429

Johanna N. Y. Franklin, Douglas Cenzer, Jiang Liu, Guohua Wu

Publication date: 2 March 2011

Published in: Archive for Mathematical Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00153-010-0198-3

zbMATH Keywords

computably enumerable setslattice embeddingssuperhighnesstruth-table degrees

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25) Other degrees and reducibilities in computability and recursion theory (03D30)

Related Items (1)

Bounded-low sets and the high/low hierarchy

Cites Work

• Unnamed Item
• A Refinement of Lown and Highn for the R.E. Degrees
• Embedding the Diamond Lattice in the Recursively Enumerable Truth-Table Degrees
• D.R.E. Degrees and the Nondiamond Theorem
• Minimal degrees of unsolvability and the full approximation construction
• Almost everywhere domination and superhighness
• On very high degrees
• Lower Bounds for Pairs of Recursively Enumerable Degrees
• Classes of Recursively Enumerable Sets and Degrees of Unsolvability
• Degrees of unsolvability complementary between recursively enumerable degrees, Part 1

This page was built for publication: A superhigh diamond in the c.e. tt-degrees