✦ LIBER ✦
Strong Minimal Covers for Recursively Enumerable Degrees
✍ Scribed by S. Barry Cooper
- Publisher
- John Wiley and Sons
- Year
- 1996
- Tongue
- English
- Weight
- 386 KB
- Volume
- 42
- Category
- Article
- ISSN
- 0044-3050
No coin nor oath required. For personal study only.
✦ Synopsis
Abstract
We prove that there exists a nonzero recursively enumerable Turing degree possessing a strong minimal cover.
Mathematics Subject Classification: 03D30.