Hostname: page-component-7b7567c8c-fvjsw Total loading time: 0 Render date: 2026-11-15T05:37:50.378Z Has data issue: false hasContentIssue false

Bounding minimal degrees by computably enumerable degrees

Published online by Cambridge University Press:  12 March 2014

Angsheng Li
Affiliation:
Institute of Software, Academia Sinica, 100080. Beijing, China. E-mail: liang@ox.ios.ac.cn
Dongping Yang
Affiliation:
Institute of Software, Academia Sinica, 100080, Beijing, China. E-mail: ydp@ox.ios.ac.cn

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.

Information

Type
Research Article
Copyright
Copyright © Association for Symbolic Logic 1998

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable