A hierarchy of computably enumerable degrees

Bulletin of Symbolic Logic 24 (1):53-89 (2018)

Abstract This article has no associated abstract. (fix it)
Keywords No keywords specified (fix it)
Categories (categorize this paper)
DOI 10.1017/bsl.2017.41
Options
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

Our Archive


Upload a copy of this paper     Check publisher's policy     Papers currently archived: 40,736
External links

Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library

References found in this work BETA

Recursive Well-Orderings.Clifford Spector - 1955 - Journal of Symbolic Logic 20 (2):151-163.

View all 21 references / Add more references

Citations of this work BETA

No citations found.

Add more citations

Similar books and articles

Complementing Cappable Degrees in the Difference Hierarchy.Rod Downey, Angsheng Li & Guohua Wu - 2004 - Annals of Pure and Applied Logic 125 (1-3):101-118.
An Interval of Computably Enumerable Isolating Degrees.Matthew C. Salts - 1999 - Mathematical Logic Quarterly 45 (1):59-72.
1-Generic Splittings of Computably Enumerable Degrees.Guohua Wu - 2006 - Annals of Pure and Applied Logic 138 (1):211-219.
Computably Enumerable Reals and Uniformly Presentable Ideals.S. A. Terwijn & R. Downey - 2002 - Mathematical Logic Quarterly 48 (S1):29-40.
Degrees of D. C. E. Reals.Rod Downey, Guohua Wu & Xizhong Zheng - 2004 - Mathematical Logic Quarterly 50 (45):345-350.
Embeddings of N5 and the Contiguous Degrees.Klaus Ambos-Spies & Peter A. Fejer - 2001 - Annals of Pure and Applied Logic 112 (2-3):151-188.
Bounding Cappable Degrees.Angsheng Li - 2000 - Archive for Mathematical Logic 39 (5):311-352.
The Computably Enumerable Degrees Are Locally Non-Cappable.Matthew B. Giorgi - 2003 - Archive for Mathematical Logic 43 (1):121-139.
Splitting Theorems and the Jump Operator.R. G. Downey & Richard A. Shore - 1998 - Annals of Pure and Applied Logic 94 (1-3):45-52.
Computably Enumerable Sets and Quasi-Reducibility.R. Downey, G. LaForte & A. Nies - 1998 - Annals of Pure and Applied Logic 95 (1-3):1-35.
Bounding Minimal Degrees by Computably Enumerable Degrees.Angsheng Li & Dongping Yang - 1998 - Journal of Symbolic Logic 63 (4):1319-1347.
On Definable Filters in Computably Enumerable Degrees.Wei Wang & Decheng Ding - 2007 - Annals of Pure and Applied Logic 147 (1):71-83.

Analytics

Added to PP index
2018-04-27

Total views
7 ( #851,366 of 2,243,780 )

Recent downloads (6 months)
1 ( #1,042,515 of 2,243,780 )

How can I increase my downloads?

Downloads

My notes

Sign in to use this feature