Arithmetical Sacks forcing

DOI10.1007/S00153-006-0004-4MaRDI QIDQ2505505zbMATH OpenOpenAlexFDO

Authors Liang Yu, Rodney G. Downey

Publication date 26 September 2006

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

Full work available at URL https://doi.org/10.1007/s00153-006-0004-4

zbMATH Keywords

minimal degreeSacks forcinghyperimmune-freeness

Mathematics Subject Classification ID

Other Turing degree structures (03D28) Higher-type and set recursion theory (03D65)

Recommendations

• Sacks forcing sometimes needs help to produce a minimal upper bound
• A hyperimmune minimal degree and an ANR 2-minimal degree
• Generics for computable Mathias forcing
• Forcing Minimal Degree of Constructibility
• A WEAKLY 2-GENERIC WHICH BOUNDS A MINIMAL DEGREE

Cites work

• scientific article; zbMATH DE number 3861137 (Why is no real title available?)
• A 1-generic degree which bounds a minimal degree
• Degrees bounding minimal degrees
• Minimal degrees recursive in 1-generic degrees
• On \(\Pi{}^ 0_ 1\) classes and their ranked points
• On degrees of recursive unsolvability
• The degrees below a 1-generic degree < 0′
• ∏ 0 1 Classes and Degrees of Theories

Cited in

(3)

• A WEAKLY 2-GENERIC WHICH BOUNDS A MINIMAL DEGREE
• Sacks forcing sometimes needs help to produce a minimal upper bound
• Sacks forcing and the shrink wrapping property

This page was built for publication: Arithmetical Sacks forcing

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