The density of the low2 n-r.e. degrees

Archive for Mathematical Logic 31 (1):19-24 (1991)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Add categories

Keywords

Reprint years

DOI

10.1007/bf01370692

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,031

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

Infima in the d.r.e. degrees.D. Kaddah - 1993 - Annals of Pure and Applied Logic 62 (3):207-263.
R.E. degrees of continuous functionals.Dag Normann - 1983 - Archive for Mathematical Logic 23 (1):79-98.
Isolated d.r.e. degrees are dense in r.e. degree structure.Decheng Ding & Lei Qian - 1996 - Archive for Mathematical Logic 36 (1):1-10.
Weak Density and Nondensity among Transfinite Levels of the Ershov Hierarchy.Yong Liu & Cheng Peng - 2020 - Notre Dame Journal of Formal Logic 61 (4):521-536.
A Refinement of Low n and High n for the R.E. Degrees.Jeanleah Mohrherr - 1986 - Mathematical Logic Quarterly 32 (1‐5):5-12.
The distribution of the generic recursively enumerable degrees.Ding Decheng - 1992 - Archive for Mathematical Logic 32 (2):113-135.
A nonlow2 R. E. Degree with the Extension of Embeddings Properties of a low2 Degree.Y. Yang & R. A. Shore - 2002 - Mathematical Logic Quarterly 48 (1):131-146.
Infima of d.r.e. degrees.Jiang Liu, Shenling Wang & Guohua Wu - 2010 - Archive for Mathematical Logic 49 (1):35-49.
S. Barry Cooper, computability theory.Lars Kristiansen - 2007 - Studia Logica 86 (1):145-146.
Cappable recursively enumerable degrees and Post's program.Klaus Ambos-Spies & André Nies - 1992 - Archive for Mathematical Logic 32 (1):51-56.

Analytics

Added to PP
2013-11-23

Downloads
56 (#293,398)

6 months
8 (#415,703)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Infima in the d.r.e. degrees.D. Kaddah - 1993 - Annals of Pure and Applied Logic 62 (3):207-263.
There is No Low Maximal D.C.E. Degree.Marat Arslanov, S. Barry Cooper & Angsheng Li - 2000 - Mathematical Logic Quarterly 46 (3):409-416.
Bounding computably enumerable degrees in the Ershov hierarchy.Angsheng Li, Guohua Wu & Yue Yang - 2006 - Annals of Pure and Applied Logic 141 (1):79-88.
Isolation in the CEA hierarchy.Geoffrey LaForte - 2005 - Archive for Mathematical Logic 44 (2):227-244.

View all 9 citations / Add more citations

References found in this work

No references found.

Add more references