Journal of Symbolic Logic 44 (4):626-642 (1979)
| Abstract | This article has no associated abstract. (fix it) |
| Keywords | No keywords specified (fix it) |
| Categories | (categorize this paper) |
| DOI | 10.2307/2273300 |
| Options |
Mark as duplicate
Export citation
Request removal from index
|
Download options
PhilArchive copy
Upload a copy of this paper Check publisher's policy Papers currently archived: 71,379
External links
- From the Publisher via CrossRef (no proxy)
- projecteuclid.org
(no proxy) - journals.cambridge.org (no proxy)
- jstor.org (no proxy)
- jstor.org [2] (no proxy)
- jstor.org [3] (no proxy)
- cambridge.org (no proxy)
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
- Sign in / register and customize your OpenURL resolver..
- Configure custom resolver
References found in this work BETA
No references found.
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.
Structural Interactions of the Recursively Enumerable T- and W-Degrees.R. G. Downey & M. Stob - 1986 - Annals of Pure and Applied Logic 31:205-236.
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 Non-Inversion Theorem for the Jump Operator.Richard A. Shore - 1988 - Annals of Pure and Applied Logic 40 (3):277-303.
A Hierarchy of Computably Enumerable Degrees.Rod Downey & Noam Greenberg - 2018 - Bulletin of Symbolic Logic 24 (1):53-89.
View all 18 citations / Add more citations
Similar books and articles
On the Strength of Ramsey's Theorem for Pairs.Peter A. Cholak, Carl G. Jockusch & Theodore A. Slaman - 2001 - Journal of Symbolic Logic 66 (1):1-55.
T-Convexity and Tame Extensions.LouDen Dries & Adam H. Lewenberg - 1995 - Journal of Symbolic Logic 60 (1):74 - 102.
Bounding Prime Models.Barbara F. Csima, Denis R. Hirschfeldt, Julia F. Knight & Robert I. Soare - 2004 - Journal of Symbolic Logic 69 (4):1117 - 1142.
Bounding Minimal Degrees by Computably Enumerable Degrees.Angsheng Li & Dongping Yang - 1998 - Journal of Symbolic Logic 63 (4):1319-1347.
On a Problem of Cooper and Epstein.Shamil Ishmukhametov - 2003 - Journal of Symbolic Logic 68 (1):52-64.
Minimal Pairs and High Recursively Enumerable Degrees.S. B. Cooper - 1974 - Journal of Symbolic Logic 39 (4):655-660.
On Minimal Pairs of Enumeration Degrees.Kevin McEvoy & S. Barry Cooper - 1985 - Journal of Symbolic Logic 50 (4):983-1001.
Definability of Types, and Pairs of o-Minimal Structures.Anand Pillay - 1994 - Journal of Symbolic Logic 59 (4):1400-1409.
Bounding and Nonbounding Minimal Pairs in the Enumeration Degrees.S. Barry Cooper, Angsheng Li, Andrea Sorbi & Yue Yang - 2005 - Journal of Symbolic Logic 70 (3):741 - 766.
Analytics
Added to PP index
2009-01-28
Total views
27 ( #425,673 of 2,519,686 )
Recent downloads (6 months)
1 ( #406,314 of 2,519,686 )
2009-01-28
Total views
27 ( #425,673 of 2,519,686 )
Recent downloads (6 months)
1 ( #406,314 of 2,519,686 )
How can I increase my downloads?
Downloads
