The Index Set of Injectively Enumerable Classes of Recursively Enumerable Sets in ∑5-Complete
✍ Scribed by Stephan Wehner
- Publisher
- John Wiley and Sons
- Year
- 1994
- Tongue
- English
- Weight
- 372 KB
- Volume
- 40
- Category
- Article
- ISSN
- 0044-3050
No coin nor oath required. For personal study only.
✦ Synopsis
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 IE.
Mathematics Subject Classification: 03D25, 03D45.
📜 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.
We develop methods for coding with first-order formulas into the partial order E of enumerable sets under inclusion. First we use them to reprove and generalize the (unpublished) result of the first author that the elementary theory of E has the same computational complexity as the theory of the nat