Embedding countable partial orderings in the enumeration degrees and the -enumeration degrees

DOI10.1093/logcom/exq051zbMath1267.03048OpenAlexW2098886724MaRDI QIDQ2907064

Ivan N. Soskov, Mariya Ivanova Soskova

Publication date: 5 September 2012

Published in: Journal of Logic and Computation (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/5f3e3e59537684ab962314174802d33e1f7c14bb

zbMATH Keywords

partial orderingsenumeration degrees\(\omega \)-enumeration degreesgood approximationsiterated jumps

Mathematics Subject Classification ID

Other degrees and reducibilities in computability and recursion theory (03D30)

Related Items

Enumeration Reducibility and Computable Structure Theory