Density of the Medvedev lattice of \(\Pi^0_1\) classes

DOI10.1007/s00153-002-0166-7zbMath1037.03040MaRDI 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

zbMATH Keywords

density; Medvedev lattice; recursive functional; degree of difficulty

Mathematics Subject Classification ID

03D25: Recursively (computably) enumerable sets and degrees

03D30: Other degrees and reducibilities in computability and recursion theory

Related Items

Medvedev Degrees of Generalized R.E. separating Classes, A COMPARISON OF VARIOUS ANALYTIC CHOICE PRINCIPLES, Medvedev degrees of two-dimensional subshifts of finite type, Comparing the Medvedev and Turing degrees of Π⁰₁ classes, Coding true arithmetic in the Medvedev degrees of \(\Pi^0_1\) classes, The Medvedev lattice of computably closed sets, Degrees of difficulty of generalized r.e. separating classes, Embedding \(\mathrm{FD}(\omega)\) into \({\mathcal{P}_s}\) densely, Inside the Muchnik degrees. II: The degree structures induced by the arithmetical hierarchy of countably continuous functions, Small \(\Pi^{0}_{1}\) classes, Inside the Muchnik degrees. I: Discontinuity, learnability and constructivism, The \(\forall \exists \)-theory of the effectively closed Medvedev degrees is decidable, A Survey of Mučnik and Medvedev Degrees, Mass Problems and Randomness, MASS PROBLEMS AND HYPERARITHMETICITY