Immunity and Non-Cupping for Closed Sets

We extend the notion of immunity to closed sets and to Π1 classes in particular in two ways: immunity meaning the corresponding tree has no infinite computable subset, and tree-immunity meaning it has no infinite computable subtree. We separate these notions from each other and that of being special, and show separating classes for computably inseparable c.e. sets are immune and perfect thin classes are tree-immune. We define the notion of prompt immunity and construct a positive-measure promptly immune Π1 class. We show that no immune-free Π 0 1 class P cups to the Medvedev complete class DNC of diagonally noncomputable sets, where P cups to Q in the Medvedv degrees of Π1 classes if there is a class R such that the product P ⊗ R ≡M Q. We characterize the interaction between (tree-)immunity and Medvedev meet and join, showing the (tree-)immune degrees form prime ideals in the Medvedev lattice. We show that every random closed set is immune and not small, and every small special class is immune.

[1]  George Barmpalias,et al.  Algorithmic Randomness of Closed Sets , 2007, J. Log. Comput..

[2]  Stephen Binns.  Hyperimmunity in 2ℕ , 2007, Notre Dame J. Formal Log..

[3]  Robert I. Soare,et al.  An algebraic decomposition of the recursively enumerable degrees and the coincidence of several degree classes with the promptly simple degrees , 1984 .

[4]  Guohua Wu,et al.  Immunity for Closed Sets , 2009, CiE.

[5]  Douglas A. Cenzer,et al.  Random Closed Sets , 2006, CiE.

[6]  Stephen Binns,et al.  Small Π01 Classes , 2006, Arch. Math. Log..

[7]  Douglas Cenzer.  ∏10 Classes in Computability Theory , 1999, Handbook of Computability Theory.

[8]  Carl G. Jockusch,et al.  Π10 classes and Boolean combinations of recursively enumerable sets , 1974, Journal of Symbolic Logic (JSL).

[9]  Carl G. Jockusch.  Pi01 Classes and Boolean Combinations of Recursively Enumerable Sets , 1974, J. Symb. Log..

[10]  André Nies,et al.  Initial Segments of The Lattice of PI01 Classes , 2001, J. Symb. Log..

[11]  R. Soare,et al.  Π⁰₁ classes and degrees of theories , 1972 .

[12]  Jeffrey B. Remmel,et al.  Chapter 13 Π10 classes in mathematics , 1998 .

[13]  Douglas A. Cenzer,et al.  Degrees of difficulty of generalized r.e. separating classes , 2008, Arch. Math. Log..

[14]  Stephen G. Simpson.  Mass problems and randomness , 2005, Bull. Symb. Log..

[15]  Douglas Cenzer,et al.  Density of the Medvedev lattice of Π01 classes , 2003, Arch. Math. Log..

[16]  S. G. Simpson.  An extension of the recursively enumerable Turing degrees , 2007 .

[17]  Stephen Binns.  A splitting theorem for the Medvedev and Muchnik lattices , 2003, Math. Log. Q..

[18]  Rodney G. Downey,et al.  Algorithmic Randomness and Complexity , 2010, Theory and Applications of Computability.

[19]  Peter A. Cholak,et al.  Automorphisms of the lattice of Π₁⁰ classes; perfect thin classes and anc degrees , 2001 .

[20]  Robert I. Soare,et al.  Degrees of members of Π10 classes , 1972 .

[21]  R. Soare.  Recursively enumerable sets and degrees , 1987 .