A jump inversion theorem for the enumeration jump

Archive for Mathematical Logic 39 (6):417-437 (2000)
  Copy   BIBTEX

Abstract

. We prove a jump inversion theorem for the enumeration jump and a minimal pair type theorem for the enumeration reducibilty. As an application some results of Selman, Case and Ash are obtained

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 106,211

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

Analytics

Added to PP
2013-11-23

Downloads
50 (#485,869)

6 months
4 (#1,001,261)

Historical graph of downloads
How can I increase my downloads?

References found in this work

Jumps of quasi-minimal enumeration degrees.Kevin McEvoy - 1985 - Journal of Symbolic Logic 50 (3):839-848.
On minimal pairs of enumeration degrees.Kevin McEvoy & S. Barry Cooper - 1985 - Journal of Symbolic Logic 50 (4):983-1001.

Add more references