The Index Set of Injectively Enumerable Classes of Recursively Enumerable Sets in ∑5‐Complete

Mathematical Logic Quarterly 40 (1):87-94 (1994)
  Copy   BIBTEX

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

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 100,063

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

On recursive enumerability with finite repetitions.Stephan Wehner - 1999 - Journal of Symbolic Logic 64 (3):927-945.
Index sets in the arithmetical Hierarchy.Ulrike Brandt - 1988 - Annals of Pure and Applied Logic 37 (2):101-110.
Index sets for Π01 classes.Douglas Cenzer & Jeffrey Remmel - 1998 - Annals of Pure and Applied Logic 93 (1):3-61.
On a Class of Recursively Enumerable Sets.Farzad Didehvar - 1999 - Mathematical Logic Quarterly 45 (4):467-470.
Effective Nonrecursiveness.Takeshi Yamaguchi - 1997 - Mathematical Logic Quarterly 43 (1):45-48.
Recursively enumerable generic sets.Wolfgang Maass - 1982 - Journal of Symbolic Logic 47 (4):809-823.
Index sets of finite classes of recursively enumerable sets.Louise Hay - 1969 - Journal of Symbolic Logic 34 (1):39-44.

Analytics

Added to PP
2013-12-01

Downloads
27 (#814,469)

6 months
5 (#1,013,651)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

On recursive enumerability with finite repetitions.Stephan Wehner - 1999 - Journal of Symbolic Logic 64 (3):927-945.

Add more citations

References found in this work

No references found.

Add more references