Elementary theories and structural properties of d-c.e. and n-c.e. degrees
From MaRDI portal
Publication:2361673
DOI10.1134/S199508021606010XzbMath1401.03073OpenAlexW2553635820WikidataQ128145772 ScholiaQ128145772MaRDI QIDQ2361673
M. M. Yamaleev, Marat M. Arslanov, Iskander Sh. Kalimullin
Publication date: 30 June 2017
Published in: Lobachevskii Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1134/s199508021606010x
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Downward density of exact degrees
- 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
- On the r. e. predecessors of d. r. e. degrees
- Density results in the \(\Delta_2^0\) e-degrees
- On relative enumerability of Turing degrees
- Non-uniformity and generalised Sacks splitting
- Interpolating \(d\)-r.e. and REA degrees between r.e. degrees
- Splitting and cone avoidance in the d.c.e. degrees
- On a hierarchy of sets. III
- Splitting properties of n-c.e. enumeration degrees
- Nonexistence of Minimal Pairs in $$L[{\mathbf d}$$]
- Elementary differences between the (2p)-C. E. and the (2p +1)-c. e. enumeration degrees
- On Downey's conjecture
- Pseudo-jump operators. II: Transfinite iterations, hierarchies and minimal covers
- 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
- Isolation and lattice embeddings
- 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
