Countable Thin Pi01 Classes

Abstract Cenzer, D., R. Downey, C. Jockusch and R.A. Shore, Countable thin Π01 classes, Annals of Pure and Applied Logic 59 (1993) 79–139. A Π01 class P ⊂ {0, 1}ω is thin if every Π01 subclass Q of P is the intersection of P with some clopen set. Countable thin Π01 classes are constructed having arbitrary recursive Cantor- Bendixson rank. A thin Π01 class P is constructed with a unique nonisolated point A and furthermore A is of degree 0’. It is shown that no set of degree ≥0” can be a member of any thin Π01 class. An r.e. degree d is constructed such that no set of degree d can be a member of any thin Π01 class. It is also shown that between any two distinct comparable r.e. degrees, there is a degree (not necessarily r.e.) that contains a set which is of rank one in some thin Π01 class. It is shown that no maximal set can have rank one in any Π01 class, while there exist maximal sets of rank 2. The connection between Π01 classes, propositional theories and recursive Boolean algebras is explored, producing several corollaries to the results on Π01 classes. For example, call a recursive Boolean algebra thin if it has no proper nonprincipal recursive ideals. Then no thin recursive Boolean algebra can have a maximal ideal of degree ≥0”.

[1]  Jeffrey B. Remmel,et al.  Graph colorings and recursively bounded Π10-classes , 1986, Ann. Pure Appl. Log..

[2]  Stephen G. Simpson,et al.  Countable algebra and set existence axioms , 1983, Ann. Pure Appl. Log..

[3]  A. Manaster,et al.  EFFECTIVE MATCHMAKING (RECURSION THEORETIC ASPECTS OF A THEOREM OF PHILIP HALL) , 1972 .

[4]  A. Lachlan ON THE LATTICE OF RECURSIVELY ENUMERABLE SETS , 1968 .

[5]  A. Nerode,et al.  Effective content of field theory , 1979 .

[6]  Manuel Lerman,et al.  Degrees of Unsolvability: Local and Global Theory , 1983 .

[7]  J. Remmel Recursively enumerable Boolean algebras , 1978 .

[8]  Donald A. Martin,et al.  Axiomatizable Theories with Few Axiomatizable Extensions , 1970, J. Symb. Log..

[9]  Donald A. Martin,et al.  Classes of Recursively Enumerable Sets and Degrees of Unsolvability , 1966 .

[10]  Rick L. Smith,et al.  Effective aspects of profinite groups , 1981, Journal of Symbolic Logic.

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

[12]  Rodney G. Downey,et al.  Abstract dependence, recursion theory, and the lattice of recursively enumerable filters , 1983, Bulletin of the Australian Mathematical Society.

[13]  C. E. M. Yates,et al.  Recursively Enumerable Sets and Retracing Functions , 1962 .

[14]  Donald A. Martin,et al.  The Degrees of Hyperimmune Sets , 1968 .

[15]  Michael Stob,et al.  Array nonrecursive sets and multiple permitting arguments , 1990 .

[16]  Peter Clote On recursive trees with a unique infinite branch , 1985 .

[17]  D. C. Cooper,et al.  Theory of Recursive Functions and Effective Computability , 1969, The Mathematical Gazette.

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

[19]  Rodney G. Downey On Π10 Classes and their Ranked Points , 1991, Notre Dame J. Formal Log..

[20]  Lawrence Feiner,et al.  Hierarchies of Boolean algebras , 1970, Journal of Symbolic Logic.

[21]  J. Remmel,et al.  Recursively presented games and strategies , 1992 .

[22]  Carl G. Jockusch,et al.  Relationships between reducibilities , 1969 .

[23]  Peter Clote,et al.  Members of countable π10 classes , 1986, Ann. Pure Appl. Log..

[24]  C. Jockusch Semirecursive sets and positive reducibility , 1968 .

[25]  R. Soare Automorphisms of the lattice of recursively enumerable sets , 1974 .

[26]  Zofia Adamowicz On Maximal Theories , 1991, J. Symb. Log..

[27]  Douglas Cenzer,et al.  On the ranked points of a Π10 set , 1989, Journal of Symbolic Logic.

[28]  Robert I. Soare,et al.  Automorphisms of the lattice of recursively enumerable sets. Part II: Low sets , 1982, Ann. Math. Log..

[29]  S. S. Goncharov,et al.  Some properties of the constructivization of Boolean algebras , 1975 .

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