Non-branching degrees in the Medvedev lattice of Π10 classes

DOI10.2178/JSL/1174668385MaRDI QIDQ3426564zbMATH OpenOpenAlexFDO

Authors Christopher P. Alfeld

Publication date 12 March 2007

Published in Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2178/jsl/1174668385

zbMATH Keywords

computably enumerable degreeMedvedev reductionnon-branching degree

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25) Other degrees and reducibilities in computability and recursion theory (03D30)

Recommendations

• Classifying the branching degrees in the Medvedev lattice of \(\Pi^0_1\) classes
• Density of the Medvedev lattice of ^0_1 classes
• Coding true arithmetic in the Medvedev degrees of ^0_1 classes
• Embeddings into the Medvedev and Muchnik lattices of ^0_1 classes
• Comparing the Medvedev and Turing degrees of \(\Pi^{0}_{1}\) classes

Cited in

(8)

• Inside the Muchnik degrees. II: The degree structures induced by the arithmetical hierarchy of countably continuous functions
• Inside the Muchnik degrees. I: Discontinuity, learnability and constructivism
• Coding true arithmetic in the Medvedev degrees of ^0_1 classes
• A Note on Closed Degrees of Difficulty of the Medvedev Lattice
• Medvedev degrees of two-dimensional subshifts of finite type
• Comparing the Medvedev and Turing degrees of \(\Pi^{0}_{1}\) classes
• Embedding \(\mathrm{FD}(\omega)\) into \({\mathcal{P}_s}\) densely
• Classifying the branching degrees in the Medvedev lattice of \(\Pi^0_1\) classes

This page was built for publication: Non-branching degrees in the Medvedev lattice of Π₁⁰ classes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3426564)