Measure theory and weak König's lemma

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)

zbMATH Keywords

reverse mathematicsmeasure theoryLebesgue measureBorel measurescountable additivitysubsystems of second order arithmetic

Mathematics Subject Classification ID

Second- and higher-order arithmetic and fragments (03F35)

Related Items (35)

1998 European Summer Meeting of the Association for Symbolic Logic ⋮ Measure theory and higher order arithmetic ⋮ Refining the taming of the reverse mathematics zoo ⋮ Open Questions in Reverse Mathematics ⋮ Reverse mathematical bounds for the termination theorem ⋮ Almost everywhere domination ⋮ Complex analysis in subsystems of second order arithmetic ⋮ Program extraction for 2-random reals ⋮ Realizability Models Separating Various Fan Theorems ⋮ A study of singular points and supports of measures in reverse mathematics ⋮ Nonstandard second-order arithmetic and Riemann's mapping theorem ⋮ To be or not to be constructive, that is not the question ⋮ RANDOMNESS NOTIONS AND REVERSE MATHEMATICS ⋮ Mixed Nash equilibria for continuous games and reverse mathematics ⋮ Separating principles below ⋮ A measure-theoretic proof of Turing incomparability ⋮ Unnamed Item ⋮ SEPARATING FRAGMENTS OF WLEM, LPO, AND MP ⋮ The Dirac delta function in two settings of reverse mathematics ⋮ Subsystems of second-order arithmetic between \(\text{RCA}_{0}\) and \(\text{WKL}_{0}\) ⋮ On the logical strengths of partial solutions to mathematical problems ⋮ Where pigeonhole principles meet Koenig lemmas ⋮ Riesz representation theorem, Borel measures and subsystems of second- order arithmetic ⋮ Algorithmic randomness, reverse mathematics, and the dominated convergence theorem ⋮ COMPARING THE STRENGTH OF DIAGONALLY NONRECURSIVE FUNCTIONS IN THE ABSENCE OF INDUCTION ⋮ On uniform relationships between combinatorial problems ⋮ A non-standard construction of Haar measure and weak König's lemma ⋮ COMPUTABILITY THEORY, NONSTANDARD ANALYSIS, AND THEIR CONNECTIONS ⋮ Mass Problems and Randomness ⋮ 10th Asian Logic Conference ⋮ Mass problems associated with effectively closed sets ⋮ Mass Problems and Measure-Theoretic Regularity ⋮ Uniform almost everywhere domination ⋮ The strength of Ramsey’s theorem for pairs over trees: I. Weak König’s Lemma ⋮ THE REVERSE MATHEMATICS OF THEOREMS OF JORDAN AND LEBESGUE

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?
• Π₁⁰ classes and Boolean combinations of recursively enumerable sets
• Degrees of Unsolvability. (AM-55)
• ∏ 0 1 Classes and Degrees of Theories

This page was built for publication: Measure theory and weak König's lemma