Noncappable enumeration degrees below 0e′

DOI10.2307/2275820zbMATH Open0874.03055OpenAlexW2005529528MaRDI QIDQ3128477FDOQ3128477

Andrea Sorbi, S. Barry Cooper

Publication date: 23 April 1997

Published in: Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2275820

zbMATH Keywords

enumeration degreenoncappable degree

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Partial degrees and the density problem. Part 2: The enumeration degrees of the Σ₂ sets are dense
• Enumeration reducibility and partial degrees
• Reducibility and Completeness for Sets of Integers
• On minimal pairs of enumeration degrees
• Enumeration Reducibility Using Bounded Information: Counting Minimal Covers
• Properly Σ2 Enumeration Degrees

Cited In (3)

• Cupping and noncupping in the enumeration degrees of \(\Sigma_ 2^ 0\) sets
• Strong enumeration reducibilities
• IN MEMORIAM: BARRY COOPER 1943–2015

This page was built for publication: Noncappable enumeration degrees below 0_e^′

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3128477)