A jump inversion theorem for the enumeration jump
โ Scribed by I.N. Soskov
- Publisher
- Springer
- Year
- 2000
- Tongue
- English
- Weight
- 181 KB
- Volume
- 39
- Category
- Article
- ISSN
- 0933-5846
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
## Abstract In [2], Jockusch and Shore have introduced a new hierarchy of sets and operators called the REA hierarchy. In this note we prove analogues of the Friedberg Jump Theorem and the Sacks Jump Theorem for many REA operators. MSC: 03D25, 03D55.
We investigate the relationship of (jumps of) the degrees of splittings of a computably enumerable set and the degree of the set. We prove that there is a high computably enumerable set whose only proper splittings are Lowe.
The volume of the sample in the temperature-jump technique was reduced from 1.2 ml to 80 pl. This was achieved by a simple modification of a commercially available cell. The sample is placed in a small chamber which is enclosed within a larger chamber containing buffered agarose gel. Sample and surr