Hostname: page-component-5d59c44645-klj7v Total loading time: 0 Render date: 2024-02-20T17:43:54.930Z Has data issue: false hasContentIssue false

WEAKLY 2-RANDOMS AND 1-GENERICS IN SCOTT SETS

Published online by Cambridge University Press:  01 May 2018

LINDA BROWN WESTRICK*
Affiliation:
DEPARTMENT OF MATHEMATICS UNIVERSITY OF CONNECTICUT STORRS, CT, USAE-mail:westrick@uconn.edu

Abstract

Let ${\cal S}$ be a Scott set, or even an ω-model of WWKL. Then for each A ε S, either there is X ε S that is weakly 2-random relative to A, or there is X ε S that is 1-generic relative to A. It follows that if A1,…,An ε S are noncomputable, there is X ε S such that each Ai is Turing incomparable with X, answering a question of Kučera and Slaman. More generally, any ∀∃ sentence in the language of partial orders that holds in ${\cal D}$ also holds in ${{\cal D}^{\cal S}}$, where ${{\cal D}^{\cal S}}$ is the partial order of Turing degrees of elements of ${\cal S}$.

Type
Articles
Copyright
Copyright © The Association for Symbolic Logic 2018 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

REFERENCES

Conidis, C. J., A measure-theoretic proof of Turing incomparability. Annals of Pure and Applied Logic, vol. 162 (2010), no. 1, pp. 8388.CrossRefGoogle Scholar
>Downey, R., Nies, A., Weber, R., and Yu, L., Lowness and ${\rm{\Pi }}_2^0$ nullsets, this Journal, vol. 71 (2006), no. 3, pp. 10441052.Downey,+R.,+Nies,+A.,+Weber,+R.,+and+Yu,+L.,+Lowness+and+${\rm{\Pi+}}_2^0$+nullsets,+this+Journal,+vol.+71+(2006),+no.+3,+pp.+1044–1052.>Google Scholar
Kučera, A. and Slaman, T. A., Turing incomparability in Scott sets. Proceedings of the American Mathematical Society, vol. 135 (2007), no. 11, pp. 37233731.CrossRefGoogle Scholar
>Lerman, M., Degrees of Unsolvability, Perspectives in Mathematical Logic, Springer-Verlag, Berlin, 1983.Google Scholar
>Li, W. and Slaman, T. A., Private communication.Li,+W.+and+Slaman,+T.+A.,+Private+communication.>Google Scholar
>Nies, A., Computability and Randomness, Oxford Logic Guides, vol. 51, Oxford University Press, Oxford, 2009.CrossRefGoogle Scholar