WEAKLY 2-RANDOMS AND 1-GENERICS IN SCOTT SETS
نویسندگان
چکیده
منابع مشابه
Limits to Joining with Generics and Randoms
Posner and Robinson [4] proved that if S ⊆ ω is non-computable, then there exists a G ⊆ ω such that S ⊕ G ≥T G′. Shore and Slaman [7] extended this result to all n ∈ ω, by showing that if S T ∅(n−1) then there exists a G such that S ⊕ G ≥T G(n). Their argument employs KumabeSlaman forcing, and so the set they obtain, unlike that of the Posner-Robinson theorem, is not generic for Cohen forcing i...
متن کاملThe Turing Degrees below generics and randoms
If x0 and x1 are both generic, the theories of the degrees below x0 and x1 are the same. The same is true if both are random. We show that the n-genericity or n-randomness of x do not su¢ ce to guarantee that the degrees below x have these common theories. We also show that these two theories (for generics and randoms) are di¤erent. These results answer questions of Jockusch as well as Barmpali...
متن کاملAlmost Weakly 2-Generic Sets
There is a family of questions in relativized complexity theory|weak analogs of the Friedberg Jump-Inversion Theorem|that are resolved by 1-generic sets but which cannot be resolved by essentially any weaker notion of genericity. This paper deenes aw2-generic sets, i.e., sets which meet every dense set of strings that is r.e. in some incomplete r.e. set. Aw2-generic sets are very close to 1-gen...
متن کاملTuring Incomparability in Scott Sets
For every Scott set F and every nonrecursive set X in F , there is a Y ∈ F such that X and Y are Turing incomparable.
متن کاملLattices of Scott-closed sets
A dcpo P is continuous if and only if the lattice C(P ) of all Scottclosed subsets of P is completely distributive. However, in the case where P is a non-continuous dcpo, little is known about the order structure of C(P ). In this paper, we study the order-theoretic properties of C(P ) for general dcpo’s P . The main results are: (i) every C(P ) is C-continuous; (ii) a complete lattice L is iso...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Journal of Symbolic Logic
سال: 2018
ISSN: 0022-4812,1943-5886
DOI: 10.1017/jsl.2017.73