1-Generic Degrees Bounding Minimal Degrees Revisited

DOI10.1007/978-3-319-50062-1_32zbMath1485.03157OpenAlexW2557475857MaRDI QIDQ2970978

No author found.

Publication date: 4 April 2017

Published in: Computability and Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-50062-1_32

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• The degree of a \(\Sigma_ n\) cut
• Minimal degrees recursive in 1-generic degrees
• On the degrees less than 0'
• NONSTANDARD MODELS IN RECURSION THEORY AND REVERSE MATHEMATICS
• A 1-generic degree which bounds a minimal degree
• The degrees below a 1-generic degree < 0′
• Degrees bounding minimal degrees
• Σ_{𝑛}-bounding and Δ_{𝑛}-induction
• The jump of a Σ _n -cut

This page was built for publication: 1-Generic Degrees Bounding Minimal Degrees Revisited