Annals of Pure and Applied Logic 31:205-236 (1986)
Abstract | This article has no associated abstract. (fix it) |
Keywords | No keywords specified (fix it) |
Categories | (categorize this paper) |
DOI | 10.1016/0168-0072(86)90071-0 |
Options |
![]() ![]() ![]() ![]() |
Download options
References found in this work BETA
A Minimal Pair of Recursively Enumerable Degrees.C. E. M. Yates - 1966 - Journal of Symbolic Logic 31 (2):159-168.
The Weak Truth Table Degrees of Recursively Enumerable Sets.Richard E. Ladner & Leonard P. Sasso - 1975 - Annals of Mathematical Logic 8 (4):429-448.
The Density of the Nonbranching Degrees.Peter A. Fejer - 1983 - Annals of Pure and Applied Logic 24 (2):113-130.
The Infinite Injury Priority Method.Robert I. Soare - 1976 - Journal of Symbolic Logic 41 (2):513-530.
View all 22 references / Add more references
Citations of this work BETA
Splitting Theorems in Recursion Theory.Rod Downey & Michael Stob - 1993 - Annals of Pure and Applied Logic 65 (1):1-106.
Classifications of Degree Classes Associated with R.E. Subspaces.R. G. Downey & J. B. Remmel - 1989 - Annals of Pure and Applied Logic 42 (2):105-124.
A Hierarchy of Computably Enumerable Degrees.Rod Downey & Noam Greenberg - 2018 - Bulletin of Symbolic Logic 24 (1):53-89.
Totally Ω-Computably Enumerable Degrees and Bounding Critical Triples.Rod Downey, Noam Greenberg & Rebecca Weber - 2007 - Journal of Mathematical Logic 7 (2):145-171.
Computably Enumerable Sets and Quasi-Reducibility.R. Downey, G. LaForte & A. Nies - 1998 - Annals of Pure and Applied Logic 95 (1-3):1-35.
View all 11 citations / Add more citations
Similar books and articles
The Isolated D. R. E. Degrees Are Dense in the R. E. Degrees.Geoffrey Laforte - 1996 - Mathematical Logic Quarterly 42 (1):83-103.
Complementation in the Turing Degrees.Theodore A. Slaman & John R. Steel - 1989 - Journal of Symbolic Logic 54 (1):160-176.
The Discontinuity of Splitting in the Recursively Enumerable Degrees.S. Barry Cooper & Xiaoding Yi - 1995 - Archive for Mathematical Logic 34 (4):247-256.
The Role of True Finiteness in the Admissible Recursively Enumerable Degrees.Noam Greenberg - 2005 - Bulletin of Symbolic Logic 11 (3):398-410.
On Recursive Enumerability with Finite Repetitions.Stephan Wehner - 1999 - Journal of Symbolic Logic 64 (3):927-945.
Splittings of 0' Into the Recursively Enumerable Degrees.Xiaoding Yi - 1996 - Mathematical Logic Quarterly 42 (1):249-269.
Recursively Enumerable M- and Tt-Degrees. I: The Quantity of M- Degrees.R. G. Downey - 1989 - Journal of Symbolic Logic 54 (2):553-567.
Cappable Recursively Enumerable Degrees and Post's Program.Klaus Ambos-Spies & André Nies - 1992 - Archive for Mathematical Logic 32 (1):51-56.
Decidability of the Two-Quantifier Theory of the Recursively Enumerable Weak Truth-Table Degrees and Other Distributive Upper Semi-Lattices.Klaus Ambos-Spies, Peter A. Fejer, Steffen Lempp & Manuel Lerman - 1996 - Journal of Symbolic Logic 61 (3):880-905.
Infima in the Recursively Enumerable Weak Truth Table Degrees.Rich Blaylock, Rod Downey & Steffen Lempp - 1997 - Notre Dame Journal of Formal Logic 38 (3):406-418.
On Σ₁-Structural Differences Among Finite Levels of the Ershov Hierarchy.Yue Yang & Liang Yu - 2006 - Journal of Symbolic Logic 71 (4):1223 - 1236.
Discontinuity of Cappings in the Recursively Enumerable Degrees and Strongly Nonbranching Degrees.Klaus Ambos-Spies & Ding Decheng - 1994 - Mathematical Logic Quarterly 40 (3):287-317.
Minimal Degrees and Recursively Inseparable Pairs of Recursively Enumerable Sets.Manuel Lerman - 1991 - Mathematical Logic Quarterly 37 (19‐22):331-342.
A Limit on Relative Genericity in the Recursively Enumerable Sets.Steffen Lempp & Theodore A. Slaman - 1989 - Journal of Symbolic Logic 54 (2):376-395.
Analytics
Added to PP index
2014-01-16
Total views
16 ( #668,892 of 2,520,401 )
Recent downloads (6 months)
4 ( #166,910 of 2,520,401 )
2014-01-16
Total views
16 ( #668,892 of 2,520,401 )
Recent downloads (6 months)
4 ( #166,910 of 2,520,401 )
How can I increase my downloads?
Downloads