Switch to: Citations

Add references

You must login to add references.
  1. Simplicity of recursively enumerable sets.Robert W. Robinson - 1967 - Journal of Symbolic Logic 32 (2):162-172.
    Download  
     
    Export citation  
     
    Bookmark   9 citations  
  • Vitali's Theorem and WWKL.Douglas K. Brown, Mariagnese Giusto & Stephen G. Simpson - 2002 - Archive for Mathematical Logic 41 (2):191-206.
    Continuing the investigations of X. Yu and others, we study the role of set existence axioms in classical Lebesgue measure theory. We show that pairwise disjoint countable additivity for open sets of reals is provable in RCA0. We show that several well-known measure-theoretic propositions including the Vitali Covering Theorem are equivalent to WWKL over RCA0.
    Download  
     
    Export citation  
     
    Bookmark   10 citations  
  • A stronger form of a theorem of Friedberg.Kempachiro Ohashi - 1964 - Notre Dame Journal of Formal Logic 5 (1):10-12.
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • Uniform Almost Everywhere Domination.Peter Cholak, Noam Greenberg & Joseph S. Miller - 2006 - Journal of Symbolic Logic 71 (3):1057 - 1072.
    We explore the interaction between Lebesgue measure and dominating functions. We show, via both a priority construction and a forcing construction, that there is a function of incomplete degree that dominates almost all degrees. This answers a question of Dobrinen and Simpson, who showed that such functions are related to the proof-theoretic strength of the regularity of Lebesgue measure for Gδ sets. Our constructions essentially settle the reverse mathematical classification of this principle.
    Download  
     
    Export citation  
     
    Bookmark   11 citations