Working Below a High Recursively Enumerable Degree
Richard A. Shore and Theodore A. Slaman
Source: J. Symbolic Logic Volume 58, Issue 3
(1993), 824-859.
Full-text: Remote
access
If you are a member of the ASL,
log in to Euclid
for access.
Full-text is available via JSTOR, for JSTOR subscribers. Go to this article in JSTOR.
Full-text is available via JSTOR, for JSTOR subscribers. Go to this article in JSTOR.
Links and Identifiers
Permanent link to this document: http://projecteuclid.org/euclid.jsl/1183744300
JSTOR: links.jstor.org
Mathematical Reviews number (MathSciNet): MR1242041
Zentralblatt MATH identifier: 0797.03043
