Infima in the d.r.e. degrees
From MaRDI portal
Publication:685080
Recommendations
Cites work
- scientific article; zbMATH DE number 3342830 (Why is no real title available?)
- A limit on relative genericity in the recursively enumerable sets
- A minimal pair of recursively enumerable degrees
- Branching Degrees above low Degrees
- Computational complexity, speedable and levelable sets
- D.R.E. Degrees and the Nondiamond Theorem
- Degrees of unsolvability complementary between recursively enumerable degrees, Part 1
- Interpolation and embedding in the recursively enumerable degrees
- Lower Bounds for Pairs of Recursively Enumerable Degrees
- Not every finite lattice is embeddable in the recursively enumerable degrees
- Recursive Enumerability and the Jump Operator
- Recursively enumerable sets and degrees
- The d.r.e. degrees are not dense
- The density of infima in the recursively enumerable degrees
- The density of the low\(_ 2\) \(n\)-r.e. degrees
- The density of the nonbranching degrees
- The recursively enumerable degrees are dense
- The undecidability of the recursively enumerable degrees
- Trial and error predicates and the solution to a problem of Mostowski
- Weak density and cupping in the d-r.e. degrees
Cited in
(9)- Infima of d.r.e. degrees
- Infima of d.r.e. degrees
- scientific article; zbMATH DE number 4164825 (Why is no real title available?)
- There Are No Maximal d.c.e. wtt-degrees
- On the r. e. predecessors of d. r. e. degrees
- The weak density of properly d-r. e. branching degree in the d-r. e. degrees
- The \(\text{low}_n\) and \(\text{low}_m\) r.e. degrees are not elementarily equivalent
- Interpolating \(d\)-r.e. and REA degrees between r.e. degrees
- The existence of high nonbounding degrees in the difference hierarchy
This page was built for publication: Infima in the d.r.e. degrees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q685080)