Switch to: Citations

Add references

You must login to add references.
  1. An effective proof that open sets are Ramsey.Jeremy Avigad - 1998 - Archive for Mathematical Logic 37 (4):235-240.
    Solovay has shown that if $\cal{O}$ is an open subset of $P(\omega)$ with code $S$ and no infinite set avoids $\cal{O}$ , then there is an infinite set hyperarithmetic in $S$ that lands in $\cal{O}$ . We provide a direct proof of this theorem that is easily formalizable in $ATR_0$.
    Download  
     
    Export citation  
     
    Bookmark   8 citations  
  • Subsystems of Second Order Arithmetic.Stephen G. Simpson - 1999 - Studia Logica 77 (1):129-129.
    Download  
     
    Export citation  
     
    Bookmark   236 citations  
  • Hindman’s theorem, ultrafilters, and reverse mathematics.Jeffry L. Hirst - 2004 - Journal of Symbolic Logic 69 (1):65-72.
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • Subsystems of Second Order Arithmetic.Stephen George Simpson - 1998 - Springer Verlag.
    Stephen George Simpson. with definition 1.2.3 and the discussion following it. For example, taking 90(n) to be the formula n §E Y, we have an instance of comprehension, VYEIXVn(n€X<—>n¢Y), asserting that for any given set Y there exists a ...
    Download  
     
    Export citation  
     
    Bookmark   131 citations