∑5-completeness of index sets arising from the lattice of recursively enumerable sets

Annals of Pure and Applied Logic 80 (1):55-67 (1996)
  Copy   BIBTEX

Abstract

We extend the techniques of Jahn to show the index set of the major subsets to be ∑5-complete. This was a question left open in Lempp and its solution involves a level-4 construction. We also show how the measuring of e-states arises naturally out of our iterated-trees approach to breaking up requirements

Categories

Keywords

Reprint years

DOI

10.1016/0168-0072(95)00055-0

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,202

External links

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

Through your library

My notes

Similar books and articles

Definable structures in the lattice of recursively enumerable sets.E. Herrmann - 1984 - Journal of Symbolic Logic 49 (4):1190-1197.
Recursively enumerable generic sets.Wolfgang Maass - 1982 - Journal of Symbolic Logic 47 (4):809-823.
Σ5-completeness of index sets arising from the recursively enumerable Turing degrees.Michael A. Jahn - 1996 - Annals of Pure and Applied Logic 79 (2):109-137.
< i> Σ_< sub> 5-completeness of index sets arising from the recursively enumerable Turing degrees.Michael A. Jahn - 1996 - Annals of Pure and Applied Logic 79 (2):109-137.
On the orbits of hyperhypersimple sets.Wolfgang Maass - 1984 - Journal of Symbolic Logic 49 (1):51-62.
Automorphisms of the lattice of recursively enumerable sets.Peter Cholak - 1995 - Providence, RI: American Mathematical Society.
Orbits of hyperhypersimple sets and the lattice of ∑03 sets.E. Herrmann - 1983 - Journal of Symbolic Logic 48 (3):693 - 699.
Recursive constructions in topological spaces.Iraj Kalantari & Allen Retzlaff - 1979 - Journal of Symbolic Logic 44 (4):609-625.
Splitting theorems for speed-up related to order of enumeration.A. M. Dawes - 1982 - Journal of Symbolic Logic 47 (1):1-7.
Nowhere simple sets and the lattice of recursively enumerable sets.Richard A. Shore - 1978 - Journal of Symbolic Logic 43 (2):322-330.
The Index Set of Injectively Enumerable Classes of Recursively Enumerable Sets in ∑5‐Complete.Stephan Wehner - 1994 - Mathematical Logic Quarterly 40 (1):87-94.
On recursive enumerability with finite repetitions.Stephan Wehner - 1999 - Journal of Symbolic Logic 64 (3):927-945.
Index sets of finite classes of recursively enumerable sets.Louise Hay - 1969 - Journal of Symbolic Logic 34 (1):39-44.
Review: Louise Hay, On Creative Sets and Indices of Partial Recursive Functions; Louise Hay, Isomorphism Types of Index Sets of Partial Recursive Functions; Louise Hay, Index Sets of Finite Classes of Recursively Enumerable Sets. [REVIEW]Forbes D. Lewis - 1974 - Journal of Symbolic Logic 39 (1):186-187.

Analytics

Added to PP
2014-01-16

Downloads
13 (#978,482)

6 months
3 (#902,269)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

< i> Σ_< sub> 5-completeness of index sets arising from the recursively enumerable Turing degrees.Michael A. Jahn - 1996 - Annals of Pure and Applied Logic 79 (2):109-137.

Add more citations

References found in this work

Add more references