Classifying the Branching Degrees in the Medvedev Lattice of Π 1 0 Classes

Abstract

A Π 1 0 class can be defined as the set of infinite paths through a computable tree. For classes P and Q , say that P is Medvedev reducible to Q , P ≤ M Q , if there is a computably continuous functional mapping Q into P . Let ℒ M be the lattice of degrees formed by Π 1 0 subclasses of 2 ω under the Medvedev reducibility. In Non-branching degrees in the Medvedev lattice of Π 1 0 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, P is separable if there is a clopen set C such that P ∩ C ≠ ∅ ≠ P ∩ C c and P ∩ C ⊥ M P ∩ C c . 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 P to be hyperseparable if, for all such C , P ∩ C ⊥ M P ∩ C c and totally separable if, for all X , Y ∈ P , X ⊥ T Y . 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 Π 1 0 classes with priority arguments.