Π01 class

In computability theory, a ÃÂ 01 class is a subset of 2ÃÂ of a certain form. These classes are of interest as technical tools within recursion theory and effective descriptive set theory. They are also used in the application of recursion theory to other branches of mathematics (Cenzer 1999, p. 39).

Definition

The set 2<ÃÂ consists of all finite sequences of 0s and 1s, while the set 2ÃÂ consists of all infinite sequences of 0s and 1s (that is, functions from } to the set }).

A tree on 2<ÃÂ is a subset of 2<ÃÂ that is closed under taking initial segments. An element f of 2ω is a path through a tree T on 2<ω if every finite initial segment of f is in T.

A (lightface) ÃÂ 01 class is a subset C of 2ω for which there is a computable tree T such that C consists of exactly the paths through T. A boldface Π01 class is a subset D of 2ω for which there is an oracle f in 2ω and a subtree tree T of 2< ω from computable from f such that D is the set of paths through T.

As effectively closed sets

The boldface ÃÂ 01 classes are exactly the same as the closed sets of 2ÃÂ and thus the same as the boldface ÃÂ 01 subsets of 2ÃÂ in the Borel hierarchy.

Lightface ÃÂ 01 classes in 2ÃÂ (that is, ÃÂ 01 classes whose tree is computable with no oracle) correspond to effectively closed sets. A subset B of 2ω is effectively closed if there is a recursively enumerable sequence &lang;σi : i ∈ ω&rang; of elements of 2< ω such that each g ∈ 2ω is in B if and only if there does not exist some i such that σi is an initial segment of B.

Relationship with effective theories

For each effectively axiomatized theory T of first-order logic, the set of all completions of T is a class. Moreover, for each subset S of there is an effectively axiomatized theory T such that each element of S computes a completion of T, and each completion of T computes an element of S (Jockusch and Soare 1972b).

References

Π01 class

Definition

As effectively closed sets

Relationship with effective theories

See also

References