Translator Disclaimer
2006 The Hypersimple-Free C.E. WTT Degrees Are Dense in the C.E. WTT Degrees
George Barmpalias, Andrew E. M. Lewis
Notre Dame J. Formal Logic 47(3): 361-370 (2006). DOI: 10.1305/ndjfl/1163775443

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.

Citation

Download Citation

George Barmpalias. Andrew E. M. Lewis. "The Hypersimple-Free C.E. WTT Degrees Are Dense in the C.E. WTT Degrees." Notre Dame J. Formal Logic 47 (3) 361 - 370, 2006. https://doi.org/10.1305/ndjfl/1163775443

Information

Published: 2006
First available in Project Euclid: 17 November 2006

zbMATH: 1113.03036
MathSciNet: MR2264705
Digital Object Identifier: 10.1305/ndjfl/1163775443

Subjects:
Primary: 03F60
Secondary: 03D30

Rights: Copyright © 2006 University of Notre Dame

JOURNAL ARTICLE
10 PAGES


SHARE
Vol.47 • No. 3 • 2006
Back to Top