Classifying the branching degrees in the Medvedev lattice of ^0_1 classes

DOI10.1215/00294527-2008-009zbMATH Open1157.03021OpenAlexW2061233788MaRDI QIDQ948754FDOQ948754

Authors: Christopher P. Alfeld 

Publication date: 20 October 2008

Published in: Notre Dame Journal of Formal Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1215/00294527-2008-009

Recommendations

• Non-branching degrees in the Medvedev lattice of Π₁⁰ classes
• Density of the Medvedev lattice of \(\Pi^0_1\) classes
• Degrees of difficulty of generalized r.e. separating classes
• Topological aspects of the Medvedev lattice
• Comparing the Medvedev and Turing degrees of \(\Pi^{0}_{1}\) classes

zbMATH Keywords

prioritymass problemseparable degree\(\Pi^0_1\)-classesbranching degrees

Mathematics Subject Classification ID

Other degrees and reducibilities in computability and recursion theory (03D30)

Cited In (3)

• Degrees of difficulty of generalized r.e. separating classes
• Non-branching degrees in the Medvedev lattice of Π₁⁰ classes
• A Note on Closed Degrees of Difficulty of the Medvedev Lattice

This page was built for publication: Classifying the branching degrees in the Medvedev lattice of \(\Pi^0_1\) classes

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