A high noncuppable \({\Sigma^0_2}\) \(e\)-degree

DOI10.1007/s00153-006-0021-3zbMath1155.03025OpenAlexW2068438761MaRDI QIDQ938229

Matthew B. Giorgi

Publication date: 18 August 2008

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

Full work available at URL: https://doi.org/10.1007/s00153-006-0021-3

zbMATH Keywords

enumeration degreeshigh degreescuppable 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)

On the jump classes of noncuppable enumeration degrees

Cites Work

• Unnamed Item
• Partial degrees and the density problem. Part 2: The enumeration degrees of the Σ₂ sets are dense
• Jumps of quasi-minimal enumeration degrees
• On minimal pairs of enumeration degrees
• Cupping and noncupping in the enumeration degrees of \(\Sigma_ 2^ 0\) sets

This page was built for publication: A high noncuppable \({\Sigma^0_2}\) \(e\)-degree