Switch to: References

Add citations

You must login to add citations.
  1. Effective Presentability of Boolean Algebras of Cantor-Bendixson Rank 1.Rod Downey & Carl G. Jockusch - 1999 - Journal of Symbolic Logic 64 (1):45-52.
    We show that there is a computable Boolean algebra $\mathscr{B}$ and a computably enumerable ideal I of $\mathscr{B}$ such that the quotient algebra $\mathscr{B}/I$ is of Cantor-Bendixson rank 1 and is not isomorphic to any computable Boolean algebra. This extends a result of L. Feiner and is deduced from Feiner's result even though Feiner's construction yields a Boolean algebra of infinite Cantor-Bendixson rank.
    Download  
     
    Export citation  
     
    Bookmark  
  • Computable Boolean algebras.Julia F. Knight & Michael Stob - 2000 - Journal of Symbolic Logic 65 (4):1605-1623.
    Download  
     
    Export citation  
     
    Bookmark   11 citations  
  • Index sets for< i> Π_< sup> 0< sub> 1 classes.Douglas Cenzer & Jeffrey Remmel - 1998 - Annals of Pure and Applied Logic 93 (1):3-61.
    Download  
     
    Export citation  
     
    Bookmark  
  • Index sets for Π01 classes.Douglas Cenzer & Jeffrey Remmel - 1998 - Annals of Pure and Applied Logic 93 (1-3):3-61.
    A Π01 class is an effectively closed set of reals. We study properties of these classes determined by cardinality, measure and category as well as by the complexity of the members of a class P. Given an effective enumeration {Pe:e < ω} of the Π01 classes, the index set I for a certain property is the set of indices e such that Pe has the property. For example, the index set of binary Π01 classes of positive measure is Σ02 complete. (...)
    Download  
     
    Export citation  
     
    Bookmark   7 citations