BOUNDING NON-GL AND R.E.A.
We prove that every Turing degree α bounding some non-GL degree is recursively enumerable in and above (r.e.a.) some l-generic degree.
| Publicado en: | Journal of Symbolic Logic Vol. 74; no. 3; pp. 989 - 1001 |
|---|---|
| Autores principales: | , , , |
| Formato: | Artículo |
| Publicado: |
Cambridge University Press
Sep2009
|
| 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=44508168&site=ehost-live header: @attributes: shortDbName: hlh uiTerm: 44508168 longDbName: Humanities International Complete uiTag: AN controlInfo: bkinfo: jinfo: jid: 00224812 3TY jtl: Journal of Symbolic Logic issn: 00224812 maglogo: N pubinfo: dt: Sep2009 vid: 74 iid: 3 pid: 15979 pub: Cambridge University Press artinfo: ui: 44508168 10.2178/jsl/1245158095 ppf: 989 ppct: 12 formats: tig: atl: BOUNDING NON-GL AND R.E.A. aug: au: AMBOS-SPIES, KLAUS DECHENG DING WEI WANG LIANG YU affil: INSTITUT FÜR INFORMATIK, UNIVERSITY OF HEIDELBERG IM NEUENHEIMER FELD 294, 69120 HEIDELBERG, GERMANY DEPARTMENT OF MATHEMATICS, NANJING UNIVERSITY 22 HANKOU ROAD, NANJING 210093, P.R. CHINA su: Boundary element methods Recursive sequences (Mathematics) Topological degree Turing (Computer program language) Mathematical logic sug: subj: Boundary element methods Recursive sequences (Mathematics) Topological degree Turing (Computer program language) Mathematical logic keyword: and phrases Generalized high/low hierarchies generic degree recursively enumerable in and above ab: We prove that every Turing degree α bounding some non-GL degree is recursively enumerable in and above (r.e.a.) some l-generic degree. pubtype: Academic Journal doctype: Article src: R language: English refInfo: copyright: @attributes: flag: Y dt: @attributes: year: 2009 holdings: @attributes: islocal: N |
|---|