Working below a low2 recursively enumerably degree

&
Archive for Mathematical Logic 29 (3):201-211 (1990)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1007/bf01621095

Other Versions

reprint Shore, Richard A.; Slaman, Theodore A. (1993) "Working below a high recursively enumerable degree". Journal of Symbolic Logic 58(3):824-859

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 102,020

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

A nonlow2 R. E. Degree with the Extension of Embeddings Properties of a low2 Degree.Richard A. Shore & Yue Yang - 2002 - Mathematical Logic Quarterly 48 (1):131-146.
Richard A. Shore. Determining automorphisms of the recursively enumerable sets. Proceedings of the American Mathematical Society, vol. 65 , pp. 318– 325. - Richard A. Shore. The homogeneity conjecture. Proceedings of the National Academy of Sciences of the United States of America, vol. 76 , pp. 4218– 4219. - Richard A. Shore. On homogeneity and definability in the first-order theory of the Turing degrees. The journal of symbolic logic, vol. 47 , pp. 8– 16. - Richard A. Shore. The arithmetic and Turing degrees are not elementarily equivalent. Archiv für mathematische Logik und Grundlagenforschung, vol. 24 , pp. 137– 139. - Richard A. Shore. The structure of the degrees of unsolvabitity. Recursion theory, edited by Anil Nerode and Richard A. Shore, Proceedings of symposia in pure mathematics, vol. 42, American Mathematical Society, Providence1985, pp. 33– 51. - Theodore A. Slaman and W. Hugh Woodin. Definability in the Turing degrees. Illinois journal of mathematics, vol. 30 , pp. 320–. [REVIEW]Carl Jockusch - 1990 - Journal of Symbolic Logic 55 (1):358-360.
The discontinuity of splitting in the recursively enumerable degrees.S. Barry Cooper & Xiaoding Yi - 1995 - Archive for Mathematical Logic 34 (4):247-256.
Degree theoretic definitions of the low2 recursively enumerable sets.Rod Downey & Richard A. Shore - 1995 - Journal of Symbolic Logic 60 (3):727 - 756.
The density of the low2 n-r.e. degrees.S. Barry Cooper - 1991 - Archive for Mathematical Logic 31 (1):19-24.
Isolation and the high/low hierarchy.Shamil Ishmukhametov & Guohua Wu - 2002 - Archive for Mathematical Logic 41 (3):259-266.
Joining to high degrees via noncuppables.Jiang Liu & Guohua Wu - 2010 - Archive for Mathematical Logic 49 (2):195-211.
The theory of the metarecursively enumerable degrees.Noam Greenberg, Richard A. Shore & Theodore A. Slaman - 2006 - Journal of Mathematical Logic 6 (1):49-68.
Nonbounding and Slaman triples.Steven D. Leonhardi - 1996 - Annals of Pure and Applied Logic 79 (2):139-163.

Analytics

Added to PP
2013-11-23

Downloads
46 (#489,982)

6 months
10 (#446,334)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Splitting theorems in recursion theory.Rod Downey & Michael Stob - 1993 - Annals of Pure and Applied Logic 65 (1):1-106.
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.

View all 14 citations / Add more citations

References found in this work

The weak truth table degrees of recursively enumerable sets.R. E. Ladner - 1975 - Annals of Mathematical Logic 8 (4):429.

Add more references