Notre Dame Journal of Formal Logic
- Notre Dame J. Formal Logic
- Volume 49, Number 3 (2008), 227-243.
Classifying the Branching Degrees in the Medvedev Lattice of Classes
A class can be defined as the set of infinite paths through a computable tree. For classes and , say that is Medvedev reducible to , , if there is a computably continuous functional mapping into . Let be the lattice of degrees formed by subclasses of under the Medvedev reducibility. In "Non-branching degrees in the Medvedev lattice of classes," I provided a characterization of nonbranching/branching and a classification of the nonbranching degrees. In this paper, I present a similar classification of the branching degrees. In particular, is separable if there is a clopen set such that and . By the results in the first paper, separability is an invariant of a Medvedev degree and a degree is branching if and only if it contains a separable member. Further define to be hyperseparable if, for all such , and totally separable if, for all , . I will show that totally separable implies hyperseparable implies separable and that the reverse implications do not hold, that is, that these are three distinct types of branching degrees. Along the way I will show some related results and present a combinatorial framework for constructing classes with priority arguments.
Notre Dame J. Formal Logic, Volume 49, Number 3 (2008), 227-243.
First available in Project Euclid: 15 July 2008
Permanent link to this document
Digital Object Identifier
Mathematical Reviews number (MathSciNet)
Zentralblatt MATH identifier
Primary: 03D30: Other degrees and reducibilities
Alfeld, Christopher P. Classifying the Branching Degrees in the Medvedev Lattice of $\Pi^0_1$ Classes. Notre Dame J. Formal Logic 49 (2008), no. 3, 227--243. doi:10.1215/00294527-2008-009. https://projecteuclid.org/euclid.ndjfl/1216152548