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

DOI10.1215/00294527-2008-009MaRDI QIDQ948754zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

\(\Pi^0_1\)-classesbranching degreesmass problempriorityseparable degree

Mathematics Subject Classification ID

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

Review text

The author provides a classification of the branching degrees in the Medvedev lattice of \(\Pi^0_1\) degrees. He shows that the branching degrees coincide with the separable degrees and defines subclasses of hyperseparable and totally separable degrees. This work parallels the author's work on non-branching degrees [``Non-branching degrees in the Medvedev lattice of \(\Pi^0_1\) classes, J. Symb. Log. 72, No.~1, 81--97 (2007; Zbl 1122.03043)] and is related to work on mass problems, e.g. \textit{S. G. Simpson}'s [``Mass problems and randomness, Bull. Symb. Log. 11, No.~1, 1--27 (2005; Zbl 1090.03015)].

Recommendations

• Non-branching degrees in the Medvedev lattice of Π₁⁰ classes
• Density of the Medvedev lattice of ^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

Cited in

(3)

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

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)