Working below a high recursively enumerable degree

Journal of Symbolic Logic 58 (3):824-859 (1993)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 90,221

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

Complementation in the Turing degrees.Theodore A. Slaman & John R. Steel - 1989 - Journal of Symbolic Logic 54 (1):160-176.
On recursive enumerability with finite repetitions.Stephan Wehner - 1999 - Journal of Symbolic Logic 64 (3):927-945.
On the orbits of hyperhypersimple sets.Wolfgang Maass - 1984 - Journal of Symbolic Logic 49 (1):51-62.
Recursively enumerable generic sets.Wolfgang Maass - 1982 - Journal of Symbolic Logic 47 (4):809-823.

Analytics

Added to PP
2009-01-28

Downloads
23 (#581,732)

6 months
3 (#439,232)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Highness and bounding minimal pairs.Rodney G. Downey, Steffen Lempp & Richard A. Shore - 1993 - Mathematical Logic Quarterly 39 (1):475-491.
Parameter definability in the recursively enumerable degrees.André Nies - 2003 - Journal of Mathematical Logic 3 (01):37-65.
On strongly jump traceable reals.Keng Meng Ng - 2008 - Annals of Pure and Applied Logic 154 (1):51-69.

View all 10 citations / Add more citations

References found in this work

Working below a low2 recursively enumerably degree.Richard A. Shore & Theodore A. Slaman - 1990 - Archive for Mathematical Logic 29 (3):201-211.

Add more references