There Are No Maximal d.c.e. wtt-degrees
From MaRDI portal
Publication:2970974
DOI10.1007/978-3-319-50062-1_28zbMATH Open1485.03161OpenAlexW2557255729MaRDI QIDQ2970974FDOQ2970974
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
Recursively (computably) enumerable sets and degrees (03D25) Other degrees and reducibilities in computability and recursion theory (03D30)
Cites Work
- Isolation and lattice embeddings
- The recursively enumerable degrees are dense
- Title not available (Why is that?)
- Classical recursion theory. Vol. II
- The d.r.e. degrees are not dense
- D.R.E. Degrees and the Nondiamond Theorem
- Reducibility and Completeness for Sets of Integers
- Lower Bounds for Pairs of Recursively Enumerable Degrees
- The weak truth table degrees of recursively enumerable sets
- \(\Delta\)\( ^ 0_ 2\) degrees and transfer theorems
- The density of the low\(_ 2\) \(n\)-r.e. degrees
- Splitting theorems in recursion theory
- Infima in the d.r.e. degrees
- A Splitting Theorem for the N-R.E. Degrees
- Wtt-degrees and T-degrees of r.e. sets
- Non-uniformity and generalised Sacks splitting
- Title not available (Why is that?)
Cited In (2)
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)