Measure theory and weak König's lemma
From MaRDI portal
Publication:2639061
DOI10.1007/BF01621469zbMath0718.03043WikidataQ124830838 ScholiaQ124830838MaRDI QIDQ2639061
Xiaokang Yu, Stephen G. Simpson
Publication date: 1990
Published in: Archive for Mathematical Logic (Search for Journal in Brave)
reverse mathematics; measure theory; Lebesgue measure; Borel measures; countable additivity; subsystems of second order arithmetic
03F35: Second- and higher-order arithmetic and fragments
Related Items
On the logical strengths of partial solutions to mathematical problems, A non-standard construction of Haar measure and weak König's lemma, Almost everywhere domination, Realizability Models Separating Various Fan Theorems, Reverse mathematical bounds for the termination theorem, Program extraction for 2-random reals, Nonstandard second-order arithmetic and Riemann's mapping theorem, A measure-theoretic proof of Turing incomparability, The Dirac delta function in two settings of reverse mathematics, Algorithmic randomness, reverse mathematics, and the dominated convergence theorem, Mass problems associated with effectively closed sets, Complex analysis in subsystems of second order arithmetic, Subsystems of second-order arithmetic between \(\text{RCA}_{0}\) and \(\text{WKL}_{0}\), Riesz representation theorem, Borel measures and subsystems of second- order arithmetic, Refining the taming of the reverse mathematics zoo, To be or not to be constructive, that is not the question, A study of singular points and supports of measures in reverse mathematics, COMPARING THE STRENGTH OF DIAGONALLY NONRECURSIVE FUNCTIONS IN THE ABSENCE OF INDUCTION, On uniform relationships between combinatorial problems, Separating principles below, SEPARATING FRAGMENTS OF WLEM, LPO, AND MP, Open Questions in Reverse Mathematics, Mass Problems and Randomness, Uniform almost everywhere domination, Measure theory and higher order arithmetic, 10th Asian Logic Conference, Mass Problems and Measure-Theoretic Regularity, 1998 European Summer Meeting of the Association for Symbolic Logic
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Which set existence axioms are needed to prove the separable Hahn-Banach theorem?
- Which set existence axioms are needed to prove the Cauchy/Peano theorem for ordinary differential equations?
- Π10 classes and Boolean combinations of recursively enumerable sets
- Degrees of Unsolvability. (AM-55)
- ∏ 0 1 Classes and Degrees of Theories
