Classes bounded by incomplete sets
โ
Kejia Ho; Frank Stephan
๐
Article
๐
2002
๐
Elsevier Science
๐
English
โ 184 KB
We study connections between strong reducibilities and properties of computably enumerable sets such as simplicity. We say that a class S of computably enumerable sets bounded i there is an m-incomplete computably enumerable set A such that every set in S is m-reducible to A. For example, we show th