Order:
  1.  54
    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 (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   34 citations  
  2.  20
    Lebesgue Convergence Theorems and Reverse Mathematics.Xiaokang Yu - 1994 - Mathematical Logic Quarterly 40 (1):1-13.
    Concepts of L1 space, integrable functions and integrals are formalized in weak subsystems of second order arithmetic. They are discussed especially in relation with the combinatorial principle WWKL (weak-weak König's lemma and arithmetical comprehension. Lebesgue dominated convergence theorem is proved to be equivalent to arithmetical comprehension. A weak version of Lebesgue monotone convergence theorem is proved to be equivalent to weak-weak König's lemma.
    Direct download  
     
    Export citation  
     
    Bookmark   9 citations  
  3.  29
    Riesz representation theorem, Borel measures and subsystems of second-order arithmetic.Xiaokang Yu - 1993 - Annals of Pure and Applied Logic 59 (1):65-78.
    Yu, X., Riesz representation theorem, Borel measures and subsystems of second-order arithmetic, Annals of Pure and Applied Logic 59 65-78. Formalized concept of finite Borel measures is developed in the language of second-order arithmetic. Formalization of the Riesz representation theorem is proved to be equivalent to arithmetical comprehension. Codes of Borel sets of complete separable metric spaces are defined and proved to be meaningful in the subsystem ATR0. Arithmetical transfinite recursion is enough to prove the measurability of Borel sets for (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   7 citations  
  4.  37
    Periodic points and subsystems of second-order arithmetic.Harvey Friedman, Stephen G. Simpson & Xiaokang Yu - 1993 - Annals of Pure and Applied Logic 62 (1):51-64.
    We study the formalization within sybsystems of second-order arithmetic of theorems concerning periodic points in dynamical systems on the real line. We show that Sharkovsky's theorem is provable in WKL0. We show that, with an additional assumption, Sharkovsky's theorem is provable in RCA0. We show that the existence for all n of n-fold iterates of continuous mappings of the closed unit interval into itself is equivalent to the disjunction of Σ02 induction and weak König's lemma.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   6 citations  
  5.  15
    A study of singular points and supports of measures in reverse mathematics.Xiaokang Yu - 1996 - Annals of Pure and Applied Logic 79 (2):211-219.
    Arithmetical comprehension is proved to be equivalent to the enumerability of singular points of any measure on the Cantor space. It is provable in ACA0 that any perfect closed subset of [0, 1] is the support of some continuous positive linear functional on C[0, 1].
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   3 citations