FORCING WITH BUSHY TREES.
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 noKurtz random real, as well as an extension of a result of Kumabe in which we establish...
| Publicado en: | Bulletin of Symbolic Logic Vol. 23; no. 2; pp. 160 - 181 |
|---|---|
| Autores principales: | , |
| Formato: | Artículo |
| Publicado: |
Cambridge University Press
Jun2017
|
| Materias: | |
| Acceso en línea: | Ver este registro en EBSCOhost |
| fields | @attributes: recordID: 1 pdfLink: plink: https://search.ebscohost.com/login.aspx?direct=true&db=hlh&AN=124107090&site=ehost-live header: @attributes: shortDbName: hlh uiTerm: 124107090 longDbName: Humanities International Complete uiTag: AN controlInfo: bkinfo: jinfo: jid: 10798986 1BA jtl: Bulletin of Symbolic Logic issn: 10798986 maglogo: N pubinfo: dt: Jun2017 vid: 23 iid: 2 pid: 15979 pub: Cambridge University Press artinfo: ui: 124107090 10.1017/bsl.2017.12 ppf: 160 ppct: 21 formats: tig: atl: FORCING WITH BUSHY TREES. aug: au: KHAN, MUSHFEQ MILLER, JOSEPH S. affil: DEPARTMENT OF MATHEMATICS UNIVERSITY OF HAWAI'I AT MANOA HONOLULU, HI 96822, USA DEPARTMENT OF MATHEMATICS UNIVERSITY OF WISCONSIN MADISON,WI 53706-1388, USA su: Asparagus densiflorus Forcing (Model theory) Algorithmic randomness Computable model theory Turing (Computer program language) sug: subj: Asparagus densiflorus Forcing (Model theory) Algorithmic randomness Computable model theory Turing (Computer program language) keyword: algorithmic randomness bushy tree forcing Diagonally noncomputable functions minimal degrees ab: 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 noKurtz 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. pubtype: Academic Journal doctype: Article src: R language: English refInfo: copyright: @attributes: flag: Y dt: @attributes: year: 2017 holdings: @attributes: islocal: N |
|---|