No CrossRef data available.
Article contents
Bounding minimal degrees by computably enumerable degrees
Published online by Cambridge University Press: 12 March 2014
Abstract
In this paper, we prove that there exist computably enumerable degrees a and b such that a > b and for any degree x, if x ≤ a and x is a minimal degree, then x < b.
- Type
- Research Article
- Information
- Copyright
- Copyright © Association for Symbolic Logic 1998