Article contents
Schnorr triviality and genericity
Published online by Cambridge University Press: 12 March 2014
Abstract
We study the connection between Schnorr triviality and genericity. We show that while no 2-generic is Turing equivalent to a Schnorr trivial and no 1-generic is tt-equivalent to a Schnorr trivial, there is a 1-generic that is Turing equivalent to a Schnorr trivial. However, every such 1-generic must be high. As a corollary, we prove that not all K-trivials are Schnorr trivial. We also use these techniques to extend a previous result and show that the bases of cones of Schnorr trivial Turing degrees are precisely those whose jumps are at least 0″.
- Type
- Research Article
- Information
- Copyright
- Copyright © Association for Symbolic Logic 2010
References
REFERENCES
- 5
- Cited by