Hostname: page-component-7b7567c8c-w7t8q Total loading time: 0 Render date: 2026-11-18T16:37:19.967Z Has data issue: false hasContentIssue false

FORCING WITH BUSHY TREES

Published online by Cambridge University Press:  21 June 2017

MUSHFEQ KHAN
Affiliation:
DEPARTMENT OF MATHEMATICS UNIVERSITY OF HAWAI‘I AT MĀNOA HONOLULU, HI 96822, USA E-mail: khan@math.hawaii.edu
JOSEPH S. MILLER
Affiliation:
DEPARTMENT OF MATHEMATICS UNIVERSITY OF WISCONSIN MADISON, WI 53706-1388, USA E-mail: jmiller@math.wisc.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.

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.

Information

Type
Articles
Copyright
Copyright © The Association for Symbolic Logic 2017