Switch to: References

Citations of:

Strong reducibility on hypersimple sets

T. G. McLaughlin

Notre Dame Journal of Formal Logic 6 (3):229-234 (1965)

Add citations

You must login to add citations.

The http://ars. els-cdn. com/content/image/http://origin-ars. els-cdn. com/content/image/1-s2. 0-S0168007205001429-si1. gif"/> degrees of computably enumerable sets are not dense. [REVIEW]George Barmpalias & Andrew Em Lewis - 2006 - Annals of Pure and Applied Logic 141 (1):51-60.details Model Theory in Logic and Philosophy of Logic Science, Logic, and Mathematics Direct download (3 more) Export citation Bookmark 5 citations
The ibT degrees of computably enumerable sets are not dense.George Barmpalias & Andrew E. M. Lewis - 2006 - Annals of Pure and Applied Logic 141 (1-2):51-60.details We show that the identity bounded Turing degrees of computably enumerable sets are not dense. Logic and Philosophy of Logic Logic and Philosophy of Logic, Miscellaneous in Logic and Philosophy of Logic Model Theory in Logic and Philosophy of Logic Direct download (3 more) Export citation Bookmark 11 citations

1