Hostname: page-component-7b7567c8c-z4zkx Total loading time: 0 Render date: 2026-11-17T19:08:31.147Z Has data issue: false hasContentIssue false

THE TURING DEGREES BELOW GENERICS AND RANDOMS

Published online by Cambridge University Press:  17 April 2014

RICHARD A. SHORE*
Affiliation:
DEPARTMENT OF MATHEMATICS, CORNELL UNIVERSITY, ITHACA NY 14853, USA E-mail: shore@math.cornell.edu
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

If X0 and X1 are both generic, the theories of the degreesbelow X0 and X1 are the same. The same is true if both arerandom. We show that the n-genericity orn-randomness of X do not suffice to guarantee that the degreesbelow X have these common theories. We also show that these two theories (forgenerics and randoms) are different. These results answer questions of Jockuschas well as Barmpalias, Day and Lewis.

Information

Type
Articles
Copyright
Copyright © Association for Symbolic Logic 2014