A survey of results on the d-c.e. and n-c.e. degrees

DOI10.1007/978-3-319-50062-1_27MaRDI QIDQ2970973zbMATH OpenOpenAlexFDO

Authors M. M. Arslanov, Iskander Kalimullin

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

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25) Other Turing degree structures (03D28)

Recommendations

• Elementary theories and structural properties of d-c.e. and n-c.e. degrees
• A survey of results on the d.c.e. and \(n\)-c.e. degrees
• scientific article; zbMATH DE number 5354059
• Model-theoretic properties of the \(n\)-c.e. degrees
• Splitting properties of n-c.e. enumeration degrees

Cites work

• scientific article; zbMATH DE number 4087652 (Why is no real title available?)
• scientific article; zbMATH DE number 1523417 (Why is no real title available?)
• scientific article; zbMATH DE number 1752644 (Why is no real title available?)
• scientific article; zbMATH DE number 3291134 (Why is no real title available?)
• scientific article; zbMATH DE number 3342830 (Why is no real title available?)
• scientific article; zbMATH DE number 3342831 (Why is no real title available?)
• A Splitting Theorem for the N-R.E. Degrees
• D.R.E. Degrees and the Nondiamond Theorem
• DEFINABILITY OF THE JUMP OPERATOR IN THE ENUMERATION DEGREES
• Decomposability of low 2-computably enumerable degrees and Turing jumps in the Ershov hierarchy
• Definability via Kalimullin pairs in the structure of the enumeration degrees
• Density results in the _2⁰ e-degrees
• Elementary differences between the (2_p)-C. E. and the (2_p +1)-c. e. enumeration degrees
• Limiting recursion
• Lower Bounds for Pairs of Recursively Enumerable Degrees
• Non-uniformity and generalised Sacks splitting
• On Downey's conjecture
• On a hierarchy of sets. III
• On a problem of Ishmukhametov
• On relative enumerability of Turing degrees
• On the r. e. predecessors of d. r. e. degrees
• Relative enumerability in the difference hierarchy
• Splitting and cone avoidance in the d.c.e. degrees
• Splitting in 2-computably enumerable degrees with avoiding cones
• Splitting properties of n-c.e. enumeration degrees
• Splitting theorems and the jump operator
• Splitting theorems in recursion theory
• The d.r.e. degrees are not dense
• The density of the low\(_ 2\) \(n\)-r.e. degrees
• There are no maximal low d.c.e. degrees
• Trial and error predicates and the solution to a problem of Mostowski

Cited in

(5)

• A survey of results on the d.c.e. and \(n\)-c.e. degrees
• On the r. e. predecessors of d. r. e. degrees
• Elementary theories and structural properties of d-c.e. and n-c.e. degrees
• Comparatives Bring a Degree-Based NPI Licenser
• Turing reducibility in the fine hierarchy

This page was built for publication: A survey of results on the d-c.e. and n-c.e. degrees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2970973)