The low basis theorem is one of several basis theorems in computability theory, each of which showing that, given an infinite subtree of the binary tree , it is possible to find an infinite path through the tree with particular computability properties. The low basis theorem, in particular, shows that there must be a path which is low; that is, the Turing jump of the path is Turing equivalent to the halting problem . Statement and proof The low basis theorem states that every nonempty class in (see arithmetical hierarchy) contains a set of low degree (Soare 1987:109). This is equivalent, by definition, to the statement that each infinite computable subtree of the binary tree has an infinite path of low degree. The proof uses the method of forcing with classes (Cooper 2004:330). Hájek and Kučera (1989) showed that the low basis is provable in the formal system of arithmetic known as . The forcing argument can also be formulated explicitly as follows. For a set X⊆ω, let f(X) = Σ{i}(X)↓2−i, where {i}(X)↓ means that Turing machine i halts on X (with the sum being over all such i). Then, for every nonempty (lightface) S⊆2ω, the (unique) X∈S minimizing f(X) has a low Turing degree. To see this, {i}(X)↓ ⇔ ∀Y∈S ({i}(Y)↓ ∨ ∃j<i ({j}(Y)↓ ∧ ¬{j}(X)↓)), which can be computed from 0′ by induction on i; note that ∀Y∈S φ(Y) is for φ. In other words, whether a machine halts on X is forced by a finite condition, with allows for X′ = 0′. Application One application of the low basis theorem is to construct completions of effective theories so that the completions have low Turing degree. For example, the low basis theorem implies the existence of PA degrees strictly below . References . The original publication, including additional clarifying prose. Theorem 1.8.37. Computability theory