Degrees of difficulty of generalized r.e. separating classes
From MaRDI portal
Publication:926177
DOI10.1007/s00153-007-0058-yzbMath1151.03020MaRDI QIDQ926177
Douglas Cenzer, Peter G. Hinman
Publication date: 26 May 2008
Published in: Archive for Mathematical Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00153-007-0058-y
03D25: Recursively (computably) enumerable sets and degrees
03D30: Other degrees and reducibilities in computability and recursion theory
Related Items
Shift-complex sequences, Computability of countable subshifts in one dimension, The random members of a \({\Pi }_{1}^{0}\) class, Inside the Muchnik degrees. II: The degree structures induced by the arithmetical hierarchy of countably continuous functions, A Survey of Mučnik and Medvedev Degrees, Conservatively Approximable Functions
Cites Work
- Unnamed Item
- Unnamed Item
- Embeddings into the Medvedev and Muchnik lattices of \(\Pi^0_1\) classes
- Classical recursion theory. The theory of functions and sets of natural numbers
- Density of the Medvedev lattice of \(\Pi^0_1\) classes
- Degrees of members of \(\Pi_ 1^ 0\) classes
- Mass Problems and Randomness
- A splitting theorem for the Medvedev and Muchnik lattices