A Survey of Results on the d-c.e. and n-c.e. Degrees
From MaRDI portal
Publication:2970973
DOI10.1007/978-3-319-50062-1_27zbMath1485.03150OpenAlexW2559561983MaRDI QIDQ2970973
Iskander Sh. Kalimullin, Marat M. Arslanov
Publication date: 4 April 2017
Published in: Computability and Complexity (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-50062-1_27
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On a problem of Ishmukhametov
- There are no maximal low d.c.e. degrees
- Decomposability of low 2-computably enumerable degrees and Turing jumps in the Ershov hierarchy
- Splitting in 2-computably enumerable degrees with avoiding cones
- The density of the low\(_ 2\) \(n\)-r.e. degrees
- The d.r.e. degrees are not dense
- Splitting theorems and the jump operator
- On the r. e. predecessors of d. r. e. degrees
- Splitting theorems in recursion theory
- Density results in the \(\Delta_2^0\) e-degrees
- On relative enumerability of Turing degrees
- Non-uniformity and generalised Sacks splitting
- Splitting and cone avoidance in the d.c.e. degrees
- On a hierarchy of sets. III
- Splitting properties of n-c.e. enumeration degrees
- Elementary differences between the (2p)-C. E. and the (2p +1)-c. e. enumeration degrees
- On Downey's conjecture
- D.R.E. Degrees and the Nondiamond Theorem
- A Splitting Theorem for the N-R.E. Degrees
- Relative enumerability in the difference hierarchy
- DEFINABILITY OF THE JUMP OPERATOR IN THE ENUMERATION DEGREES
- Definability via Kalimullin pairs in the structure of the enumeration degrees
- Lower Bounds for Pairs of Recursively Enumerable Degrees
- Trial and error predicates and the solution to a problem of Mostowski
- Limiting recursion
This page was built for publication: A Survey of Results on the d-c.e. and n-c.e. Degrees
