Switch to: Citations

Add references

You must login to add references.
  1. Friedman's Research on Subsystems of Second Order Arithmetic.Stephen G. Simpson - 1990 - Journal of Symbolic Logic 55 (2):870-874.
    Download  
     
    Export citation  
     
    Bookmark   9 citations  
  • Measure theory and weak König's lemma.Xiaokang Yu & Stephen G. Simpson - 1990 - Archive for Mathematical Logic 30 (3):171-180.
    We develop measure theory in the context of subsystems of second order arithmetic with restricted induction. We introduce a combinatorial principleWWKL (weak-weak König's lemma) and prove that it is strictly weaker thanWKL (weak König's lemma). We show thatWWKL is equivalent to a formal version of the statement that Lebesgue measure is countably additive on open sets. We also show thatWWKL is equivalent to a formal version of the statement that any Borel measure on a compact metric space is countably additive (...)
    Download  
     
    Export citation  
     
    Bookmark   34 citations  
  • Which set existence axioms are needed to prove the cauchy/peano theorem for ordinary differential equations?Stephen G. Simpson - 1984 - Journal of Symbolic Logic 49 (3):783-802.
    We investigate the provability or nonprovability of certain ordinary mathematical theorems within certain weak subsystems of second order arithmetic. Specifically, we consider the Cauchy/Peano existence theorem for solutions of ordinary differential equations, in the context of the formal system RCA 0 whose principal axioms are ▵ 0 1 comprehension and Σ 0 1 induction. Our main result is that, over RCA 0 , the Cauchy/Peano Theorem is provably equivalent to weak Konig's lemma, i.e. the statement that every infinite {0, 1}-tree (...)
    Download  
     
    Export citation  
     
    Bookmark   41 citations  
  • Which set existence axioms are needed to prove the separable Hahn-Banach theorem?Douglas K. Brown & Stephen G. Simpson - 1986 - Annals of Pure and Applied Logic 31:123-144.
    Download  
     
    Export citation  
     
    Bookmark   35 citations  
  • Weak comparability of well orderings and reverse mathematics.Harvey M. Friedman & Jeffry L. Hirst - 1990 - Annals of Pure and Applied Logic 47 (1):11-29.
    Two countable well orderings are weakly comparable if there is an order preserving injection of one into the other. We say the well orderings are strongly comparable if the injection is an isomorphism between one ordering and an initial segment of the other. In [5], Friedman announced that the statement “any two countable well orderings are strongly comparable” is equivalent to ATR 0 . Simpson provides a detailed proof of this result in Chapter 5 of [13]. More recently, Friedman has (...)
    Download  
     
    Export citation  
     
    Bookmark   20 citations