## Arithmetical Sacks Forcing

### Cached

### Download Links

- [www.mcs.vuw.ac.nz]
- [www.mcs.vuw.ac.nz]
- [homepages.ecs.vuw.ac.nz]
- [www.mcs.vuw.ac.nz]
- [math.nju.edu.cn]
- DBLP

### Other Repositories/Bibliography

Venue: | Archive for Mathematical Logic |

Citations: | 3 - 0 self |

### BibTeX

@ARTICLE{Downey_arithmeticalsacks,

author = {Rod Downey and Liang Yu},

title = {Arithmetical Sacks Forcing},

journal = {Archive for Mathematical Logic},

year = {},

volume = {45},

pages = {2006}

}

### OpenURL

### Abstract

Abstract. We answer a question of Jockusch by constructing a hyperimmunefree minimal degree below a 1-generic one. To do this we introduce a new forcing notion called arithmetical Sacks forcing. Some other applications are presented. 1. introduction Two fundamental construction techniques in set theory and computability theory are forcing with finite strings as conditions resulting in various forms of Cohen genericity, and forcing with perfect trees, resulting in various forms of minimality. Whilst these constructions are clearly incompatible, this paper was motivated by the general question of “How can minimality and (Cohen) genericity interact?”. Jockusch [5] showed that for n ≥ 2, no n-generic degree can bound a minimal degree, and Haught [4] extended earlier work of Chong and Jockusch to show that that every nonzero Turing degree below a 1-generic degree below 0 ′ was itself 1generic. Thus, it seemed that these forcing notions were so incompatible that perhaps no minimal degree could even be comparable with a 1-generic one. However, this conjecture was shown to fail independently by Chong and Downey [1] and by Kumabe [7]. In each of those papers, a minimal degree below m < 0 ′ and a 1-generic a < 0 ′ ′ are constructed with m < a. The specific question motivating the present paper is one of Jockusch who asked whether a hyperimmune-free (minimal) degree could be below a 1-generic one. The point here is that the construction of a hyperimmune-free degree by and large directly uses forcing with perfect trees, and is a much more “pure ” form of Spector-Sacks forcing [10] and [9]. This means that it is not usually possible to use tricks such as full approximation or forcing with partial computable trees, which are available to us when we only wish to construct (for instance) minimal degrees. For instance, minimal degrees can be below computably enumerable ones, whereas no degree below 0 ′ can be hyperimmune-free. Moreover, the results of Jockusch [5], in fact prove that for n ≥ 2, if 0 < a ≤ b and b is n-generic, then a bounds a n-generic degrees and, in particular, certainly is not hyperimmune free. This contrasts quite strongly with the main result below. In this paper we will answer Jockusch’s question, proving the following result.

### Citations

126 |
Π 0 1 classes and degrees of theories
- Soare
- 1979
(Show Context)
Citation Context ...σ for which Ψ τ (e) ↓ at stage |τ|. Since Ψ g is total, Φ must be total. Φ has an index e. Then Φe(e) = Φ(e) = Ψ τ (e) for some τ ≻ σ. A contradiction. � Proof. (of proposition 3.9) By Jockusch-Soare =-=[6]-=-, there is a hyperimmune-free DNR-degree. But, by Lemma 3.10, no 1-generic degree can compute a DNR degree. � Perhaps it might be the case that every minimal hyperimmune-free degree is computable in a... |

32 |
On degrees of recursive unsolvability
- Spector
- 1956
(Show Context)
Citation Context ...low a 1-generic one. The point here is that the construction of a hyperimmune-free degree by and large directly uses forcing with perfect trees, and is a much more “pure” form of SpectorSacks forcing =-=[10]-=- and [9]. This means that it is not usually possible to use tricks such as full approximation or forcing with partial computable trees, which are available to us when we only wish to construct (for in... |

12 | Degrees of Unsolvability: Local and Global Theory - Lerman |

10 |
1980], Degrees of generic sets, in Recursion theory: its generalisation and applications (Proc. Logic Colloq
- Jockusch
- 1979
(Show Context)
Citation Context ...n various forms of minimality. Whilst these constructions are clearly incompatible, this paper was motivated by the general question of “How can minimality and (Cohen) genericity interact?”. Jockusch =-=[5]-=- showed that for n ≥ 2, no n-generic degree can bound a minimal degree, and Haught [4] extended earlier work of Chong and Jockusch to show that that every nonzero Turing degree below a 1-generic degre... |

7 |
On Π 0 1 classes and their ranked points, Notre Dame
- Downey
- 1991
(Show Context)
Citation Context ... (sketch) In Chong and Downey [1], using a full approximation argument, a minimal degree m is constructed with a Σ1-dense set of strings, and hence one not computable in a 1-generic degree. In Downey =-=[3]-=-, it is shown how to construct a (minimal) hyperimmune free degree below 0 ′′ using a full approximation argument. The point is that these two constructions are compatible, with great detail and no re... |

6 |
Minimal degrees recursive in 1-generic degrees
- Chong, Downey
- 1990
(Show Context)
Citation Context ...equirement. (4) says arithmetical Sacks sets are well-defined. � The following corollary is immediate. Corollary 3.2. If G is an Arithmetical Sacks set, the G is a hyperimmune-free minimal degree. In =-=[2]-=-, Chong and Downey introduced the following notation. Definition 3.3. Given a set G ⊆ ω, (1) A set T ⊆ 2 <ω is dense in G if for any n ∈ ω, there is a finite string σ ∈ T so that G ↾ n � σ. (2) A set ... |

5 |
A 1-generic degree which bounds a minimal degree
- Kumabe
- 1990
(Show Context)
Citation Context ...tions were so incompatible that perhaps no minimal degree could even be comparable with a 1-generic one. However, this conjecture was shown to fail independently by Chong and Downey [1] and by Kumabe =-=[7]-=-. In each of those papers, a minimal degree below m < 0 ′ and a 1-generic a < 0 ′′ are constructed with m < a. The specific question motivating the present paper is one of Jockusch who asked whether a... |

4 |
The degrees below a 1-generic degree < 0
- Haught
- 1986
(Show Context)
Citation Context ...is paper was motivated by the general question of “How can minimality and (Cohen) genericity interact?”. Jockusch [5] showed that for n ≥ 2, no n-generic degree can bound a minimal degree, and Haught =-=[4]-=- extended earlier work of Chong and Jockusch to show that that every nonzero Turing degree below a 1-generic degree below 0 ′ was itself 1generic. Thus, it seemed that these forcing notions were so in... |

3 |
Degrees bounding minimal degrees
- Chong, Downey
- 1989
(Show Context)
Citation Context ...t these forcing notions were so incompatible that perhaps no minimal degree could even be comparable with a 1-generic one. However, this conjecture was shown to fail independently by Chong and Downey =-=[1]-=- and by Kumabe [7]. In each of those papers, a minimal degree below m < 0 ′ and a 1-generic a < 0 ′′ are constructed with m < a. The specific question motivating the present paper is one of Jockusch w... |

3 |
Forcing with perfect closed sets. 1971 Axiomatic Set Theory (Proc
- Sacks
- 1967
(Show Context)
Citation Context ...eneric one. The point here is that the construction of a hyperimmune-free degree by and large directly uses forcing with perfect trees, and is a much more “pure” form of SpectorSacks forcing [10] and =-=[9]-=-. This means that it is not usually possible to use tricks such as full approximation or forcing with partial computable trees, which are available to us when we only wish to construct (for instance) ... |