Strong Degrees of Categoricity and Weak Density of this result to properly
2-c.e. degrees. We found a condition such that if a Δ02-degree is a degree
Structural properties of Q-degrees of n-c. e. sets on the distribution of incomparable Q-degrees. In another theorem we prove that every incomplete Π
2 0 Q-degree forms a
On Fairly Low and Superlow Sets that the proper intermediate place of fairly low
sets holds even if we restrict our attention to
computably Structural properties of Q-degrees of n-c. e. sets on the distribution of incomparable Q-degrees. In another theorem we prove that every incomplete Π
2 0 Q-degree forms a
The enumeration spectrum hierarchy of α-families and lowα degrees countable
sets in the ZFC-theory with urelements from N. The families from the hierarchy can be coded
A semilattice generated by superlow computably enumerable degreesWe prove that a partially ordered
set of all
computably enumerable (c. e.) degrees
О подмножествах рекурсивно перечислимых множествLet and be the recursively
enumerable sets and is total recursive function, which is
enumerate A