A nonlow2 R. E. Degree with the Extension of Embeddings Properties of a low2 Degree

Mathematical Logic Quarterly 48 (1):131-146 (2002)
  Copy   BIBTEX

Abstract

We construct a nonlow2 r.e. degree d such that every positive extension of embeddings property that holds below every low2 degree holds below d. Indeed, we can also guarantee the converse so that there is a low r.e. degree c such that that the extension of embeddings properties true below c are exactly the ones true belowd.Moreover, we can also guarantee that no b ≤ d is the base of a nonsplitting pair

Links

PhilArchive



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

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

Joining to high degrees via noncuppables.Jiang Liu & Guohua Wu - 2010 - Archive for Mathematical Logic 49 (2):195-211.
Complementation in the Turing degrees.Theodore A. Slaman & John R. Steel - 1989 - Journal of Symbolic Logic 54 (1):160-176.
On relative enumerability of Turing degrees.Shamil Ishmukhametov - 2000 - Archive for Mathematical Logic 39 (3):145-154.
On the r.e. predecessors of d.r.e. degrees.Shamil Ishmukhametov - 1999 - Archive for Mathematical Logic 38 (6):373-386.
Bounding non- GL ₂ and R.E.A.Klaus Ambos-Spies, Decheng Ding, Wei Wang & Liang Yu - 2009 - Journal of Symbolic Logic 74 (3):989-1000.
Highness and bounding minimal pairs.Rodney G. Downey, Steffen Lempp & Richard A. Shore - 1993 - Mathematical Logic Quarterly 39 (1):475-491.
Isolation and the high/low hierarchy.Shamil Ishmukhametov & Guohua Wu - 2002 - Archive for Mathematical Logic 41 (3):259-266.
Isolation and lattice embeddings.Guohua Wu - 2002 - Journal of Symbolic Logic 67 (3):1055-1064.
Strong Minimal Covers for Recursively Enumerable Degrees.S. Barry Cooper - 1996 - Mathematical Logic Quarterly 42 (1):191-196.

Analytics

Added to PP
2013-12-01

Downloads
25 (#614,662)

6 months
5 (#652,053)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Yun Yang
University of California, Berkeley

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references