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

DOI10.1007/978-3-319-50062-1_28zbMath1485.03161OpenAlexW2557255729MaRDI QIDQ2970974

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

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

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