Switch to: Citations

Add references

You must login to add references.
  1. 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   34 citations  
  • Fixed point theory in weak second-order arithmetic.Naoki Shioji & Kazuyuki Tanaka - 1990 - Annals of Pure and Applied Logic 47 (2):167-188.
    Download  
     
    Export citation  
     
    Bookmark   15 citations  
  • (1 other version)Fragments of arithmetic.Wilfried Sieg - 1985 - Annals of Pure and Applied Logic 28 (1):33-71.
    We establish by elementary proof-theoretic means the conservativeness of two subsystems of analysis over primitive recursive arithmetic. The one subsystem was introduced by Friedman [6], the other is a strengthened version of a theory of Minc [14]; each has been shown to be of considerable interest for both mathematical practice and metamathematical investigations. The foundational significance of such conservation results is clear: they provide a direct finitist justification of the part of mathematical practice formalizable in these subsystems. The results are (...)
    Download  
     
    Export citation  
     
    Bookmark   53 citations  
  • The baire category theorem in weak subsystems of second-order arithmetic.Douglas K. Brown & Stephen G. Simpson - 1993 - Journal of Symbolic Logic 58 (2):557-578.
    Working within weak subsystems of second-order arithmetic Z2 we consider two versions of the Baire Category theorem which are not equivalent over the base system RCA0. We show that one version (B.C.T.I) is provable in RCA0 while the second version (B.C.T.II) requires a stronger system. We introduce two new subsystems of Z2, which we call RCA+ 0 and WKL+ 0, and show that RCA+ 0 suffices to prove B.C.T.II. Some model theory of WKL+ 0 and its importance in view of (...)
    Download  
     
    Export citation  
     
    Bookmark   15 citations  
  • Located sets and reverse mathematics.Mariagnese Giusto & Stephen Simpson - 2000 - Journal of Symbolic Logic 65 (3):1451-1480.
    Let X be a compact metric space. A closed set K $\subseteq$ X is located if the distance function d(x, K) exists as a continuous real-valued function on X; weakly located if the predicate d(x, K) $>$ r is Σ 0 1 allowing parameters. The purpose of this paper is to explore the concepts of located and weakly located subsets of a compact separable metric space in the context of subsystems of second order arithmetic such as RCA 0 , WKL (...)
    Download  
     
    Export citation  
     
    Bookmark   16 citations  
  • (1 other version)WKL0 and Stone's separation theorem for convex sets.Kostas Hatzikiriakou - 1996 - Annals of Pure and Applied Logic 77 (3):245-249.
    The Stone's Separation Theorem is equivalent to Weak König's Lemma.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • (1 other version)WKL< sub> 0 and Stone's separation theorem for convex sets.Kostas Hatzikiriakou - 1996 - Annals of Pure and Applied Logic 77 (3):245-249.
    The Stone's Separation Theorem is equivalent to Weak König's Lemma.
    Download  
     
    Export citation  
     
    Bookmark   1 citation