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.

Detalles Bibliográficos
Publicado en:	Journal of Symbolic Logic Vol. 74; no. 3; pp. 989 - 1001
Autores principales:	AMBOS-SPIES, KLAUS, DECHENG DING, WEI WANG, LIANG YU
Formato:	Artículo
Publicado:	Cambridge University Press Sep2009
Materias:	Boundary element methods Recursive sequences (Mathematics) Topological degree Turing (Computer program language) Mathematical logic
Acceso en línea:	Ver este registro en EBSCOhost

Descripción
Sumario:	We prove that every Turing degree α bounding some non-GL degree is recursively enumerable in and above (r.e.a.) some l-generic degree.