Arithmetical Sacks forcing (Q2505505): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1007/s00153-006-0004-4 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2020431039 / rank | |||
Normal rank |
Revision as of 15:23, 19 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Arithmetical Sacks forcing |
scientific article |
Statements
Arithmetical Sacks forcing (English)
0 references
26 September 2006
0 references
The authors construct a hyperimmune-free minimal degree below a 1-generic degree, thereby settling a question posed by Jockusch. In fact, they indicate how to accomplish this so that the degrees lie below \(\mathbf{0''}\). The paper's title refers to the construction method they introduce, which is based on computable perfect trees. They also show that, in contrast, there exists a hyperimmune-free degree \(\mathbf m\) not below any 1-generic degree, and they sketch a proof that \(\mathbf m\) may even be chosen to be minimal and below \(\mathbf{0''}\).
0 references
Sacks forcing
0 references
hyperimmune-freeness
0 references
minimal degree
0 references