Article contents
FORCING WITH BUSHY TREES
Published online by Cambridge University Press: 21 June 2017
Abstract
We present several results that rely on arguments involving the combinatorics of “bushy trees”. These include the fact that there are arbitrarily slow-growing diagonally noncomputable (DNC) functions that compute no Kurtz random real, as well as an extension of a result of Kumabe in which we establish that there are DNC functions relative to arbitrary oracles that are of minimal Turing degree. Along the way, we survey some of the existing instances of bushy tree arguments in the literature.
Keywords
- Type
- Articles
- Information
- Copyright
- Copyright © The Association for Symbolic Logic 2017
References
REFERENCES
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20170621105957617-0487:S1079898617000129:S1079898617000129_inline1.gif?pub-status=live)
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20170621105957617-0487:S1079898617000129:S1079898617000129_inline2.gif?pub-status=live)
- 5
- Cited by