Strong enumeration properties of recursively enumerable classes
β Scribed by J. B. Florence
- Publisher
- John Wiley and Sons
- Year
- 1969
- Tongue
- English
- Weight
- 654 KB
- Volume
- 15
- Category
- Article
- ISSN
- 0044-3050
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
## Abstract We define a class of soβcalled β(__n__)βsets as a natural closure of recursively enumerable sets __W__~n~ under the relation βββ and study its properties.
## Abstract We prove that there exists a nonzero recursively enumerable Turing degree possessing a strong minimal cover. Mathematics Subject Classification: 03D30.
## Abstract I introduce an effective enumeration of all effective enumerations of classes of r. e. sets and define with this the index set __IE__ of injectively enumerable classes. It is easy to see that this set is β~5~ in the Arithmetical Hierarchy and I describe a proof for the β~5~βhardness of