Interpolating \(d\)-r.e. and REA degrees between r.e. degrees
From MaRDI portal
Publication:1919759
DOI10.1016/0168-0072(96)00014-0zbMath0855.03025MaRDI QIDQ1919759
Richard A. Shore, Steffen Lempp, Marat M. Arslanov
Publication date: 9 February 1997
Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0168-0072(96)00014-0
03D25: Recursively (computably) enumerable sets and degrees
03D30: Other degrees and reducibilities in computability and recursion theory
Related Items
On the jumps of the degrees below a recursively enumerable degree, Turing computability: structural theory, \textit{CEA} operators and the ershov hierarchy, Elementary theories and structural properties of d-c.e. and n-c.e. degrees, The Non-isolating Degrees Are Upwards Dense in the Computably Enumerable Degrees
Cites Work
- Weak density and cupping in the d-r.e. degrees
- Infima in the d.r.e. degrees
- The density of the low\(_ 2\) \(n\)-r.e. degrees
- The d.r.e. degrees are not dense
- Definability in the enumeration degrees
- The recursively enumerable degrees are dense
- On a hierarchy of sets. III
- On the degrees less than 0'
- On a Conjecture of Kleene and Post
- A minimal degree less than 0’
- The jump is definable in the structure of the degrees of unsolvability
- On homogeneity and definability in the first-order theory of the Turing degrees
- Pseudo-jump operators. II: Transfinite iterations, hierarchies and minimal covers
- Reducibility orderings: Theories, definability and automorphisms
- A Splitting Theorem for the N-R.E. Degrees
- Trial and error predicates and the solution to a problem of Mostowski
- Limiting recursion
- A Dichotomy of the Recursively Enumerable Sets
- Degrees of unsolvability complementary between recursively enumerable degrees, Part 1
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
