The Hypersimple-Free C.E. WTT Degrees Are Dense in the C.E. WTT Degrees
George Barmpalias and Andrew E. M. Lewis
Source: Notre Dame J. Formal Logic Volume 47, Number 3
(2006), 361-370.
Abstract
We show that in the c.e. weak truth table degrees if b < c then there is an a which contains no hypersimple set and b < a < c. We also show that for every w < c in the c.e. wtt degrees such that w is hypersimple, there is a hypersimple a such that w < a < c. On the other hand, we know that there are intervals which contain no hypersimple set.
First Page:
Show
Hide
Full-text: Open access
Links and Identifiers
Permanent link to this document: http://projecteuclid.org/euclid.ndjfl/1163775443
Digital Object Identifier: doi:10.1305/ndjfl/1163775443
Mathematical Reviews number (MathSciNet): MR2264705
Zentralblatt MATH identifier: 1113.03036
References
[1] Barmpalias, G., "Hypersimplicity and semicomputability in the weak truth table degrees", Archive for Mathematical Logic, vol. 44 (2005), pp. 1045--65.
Mathematical Reviews (MathSciNet): MR2193189
Zentralblatt MATH: 1077.03026
Digital Object Identifier: doi:10.1007/s00153-005-0288-9
Notre Dame Journal of Formal Logic