Infima of d.r.e. degrees
The authors obtain the following result: Given c.e. degrees \({\mathbf u}<{\mathbf v}\), there are d.c.e. degrees \({\mathbf a},{\mathbf b}_1,{\mathbf b}_2\) and a 3-c.e. degree \({\mathbf x}\) between \({\mathbf u}\) and \({\mathbf v}\) such that \({\mathbf a}<{\mathbf x}<{\mathbf b}_1,{\mathbf b}_2\) and \({\mathbf b}_1\) and \({\mathbf b}_2\) have infimum \({\mathbf a}\) in the d.c.e. degrees. This result extends \textit{D. Kaddah}'s result [Ann. Pure Appl. Logic 62, No. 3, 207--263 (1993; Zbl 0784.03023)] and implies that the isolated \(3\)-c.e. degrees are dense in the c.e. degrees, which was first proved by LaForte.
- Infima of d.r.e. degrees
- Infima in the d.r.e. degrees
- Degrees of d. c. e. reals
- D.R.E. Degrees and the Nondiamond Theorem
- Isolated maximal d.r.e. degrees
- scientific article; zbMATH DE number 4021121
- Cupping the Recursively Enumerable Degrees by D.R.E. Degrees
- Extremes in the degrees of inferability
- Publication:4891408
- Partial degrees and \(r\)-degrees
- Classical recursion theory. The theory of functions and sets of natural numbers
- scientific article; zbMATH DE number 4091484 (Why is no real title available?)
- Infima in the d.r.e. degrees
- Infima of d.r.e. degrees
- Isolation in the CEA hierarchy
- Lower Bounds for Pairs of Recursively Enumerable Degrees
- The upper semi-lattice of degrees of recursive unsolvability
- Weak density and cupping in the d-r.e. degrees
This page was built for publication: Infima of d.r.e. degrees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2655142)
