AVOIDING EFFECTIVE PACKING DIMENSION 1 BELOW ARRAY NONCOMPUTABLE C.E. DEGREES.

The article discusses avoiding effective packing dimension 1 below arraynoncomputable computably enumerable (c.e.) degrees. It discusses research work showing that there is a Turing degree with nonzero effective packing dimension, but which does not contain any set of effective packing dimension 1....

Descripción completa

Detalles Bibliográficos
Publicado en:	Journal of Symbolic Logic Vol. 83; no. 2; pp. 717 - 740
Autores principales:	DOWNEY, ROD, STEPHENSON, JONATHAN
Formato:	Artículo
Publicado:	Cambridge University Press Jun2018
Materias:	Computable functions Programmable array logic Unsolvability (Mathematical logic) Dimension theory (Topology) Computability logic
Acceso en línea:	Ver este registro en EBSCOhost

Descripción
Sumario:	The article discusses avoiding effective packing dimension 1 below arraynoncomputable computably enumerable (c.e.) degrees. It discusses research work showing that there is a Turing degree with nonzero effective packing dimension, but which does not contain any set of effective packing dimension 1. It shows the existence of such a degree below every c.e. array noncomputable degree, and hence that they occur below precisely those of the c.e. degrees which are array noncomputable.