There Are No Maximal d.c.e. wtt-degrees

DOI10.1007/978-3-319-50062-1_28MaRDI QIDQ2970974zbMATH OpenOpenAlexFDO

Authors Guohua Wu, M. M. Yamaleev

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_28

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25) Other degrees and reducibilities in computability and recursion theory (03D30)

Cites work

• scientific article; zbMATH DE number 4091484 (Why is no real title available?)
• scientific article; zbMATH DE number 1390014 (Why is no real title available?)
• A Splitting Theorem for the N-R.E. Degrees
• Classical recursion theory. Vol. II
• D.R.E. Degrees and the Nondiamond Theorem
• Infima in the d.r.e. degrees
• Isolation and lattice embeddings
• Lower Bounds for Pairs of Recursively Enumerable Degrees
• Non-uniformity and generalised Sacks splitting
• Reducibility and Completeness for Sets of Integers
• Splitting theorems in recursion theory
• The d.r.e. degrees are not dense
• The density of the low\(_ 2\) \(n\)-r.e. degrees
• The recursively enumerable degrees are dense
• The weak truth table degrees of recursively enumerable sets
• Wtt-degrees and T-degrees of r.e. sets
• \(\Delta\)\( ^ 0_ 2\) degrees and transfer theorems

Cited in

(2)

• scientific article; zbMATH DE number 1523417 (Why is no real title available?)
• There are no maximal low d.c.e. degrees

This page was built for publication: There Are No Maximal d.c.e. wtt-degrees

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