Density of the Medvedev lattice of \(\Pi^0_1\) classes
From MaRDI portal
Publication:1407612
DOI10.1007/s00153-002-0166-7zbMath1037.03040OpenAlexW1990923977MaRDI QIDQ1407612
Douglas Cenzer, Peter G. Hinman
Publication date: 16 September 2003
Published in: Archive for Mathematical Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00153-002-0166-7
Recursively (computably) enumerable sets and degrees (03D25) Other degrees and reducibilities in computability and recursion theory (03D30)
Related Items
The Medvedev lattice of computably closed sets, A Survey of Mučnik and Medvedev Degrees, Inside the Muchnik degrees. I: Discontinuity, learnability and constructivism, The \(\forall \exists \)-theory of the effectively closed Medvedev degrees is decidable, Coding true arithmetic in the Medvedev degrees of \(\Pi^0_1\) classes, MASS PROBLEMS AND HYPERARITHMETICITY, Inside the Muchnik degrees. II: The degree structures induced by the arithmetical hierarchy of countably continuous functions, Degrees of difficulty of generalized r.e. separating classes, Embedding \(\mathrm{FD}(\omega)\) into \({\mathcal{P}_s}\) densely, Medvedev degrees of two-dimensional subshifts of finite type, Medvedev Degrees of Generalized R.E. separating Classes, Comparing the Medvedev and Turing degrees of Π01 classes, Small \(\Pi^{0}_{1}\) classes, Mass Problems and Randomness, A COMPARISON OF VARIOUS ANALYTIC CHOICE PRINCIPLES