On sequential theorems in reverse mathematics

From MaRDI portal





This work in higher-order reverse mathematics uses the base system \(\mathsf{RCA}^\omega_0\) proposed by \textit{U. Kohlenbach} [Lect. Notes Log. 21, 281--295 (2005; Zbl 1097.03053)]. The authors formalize definitions for semi-continuous functions in this setting and prove in \(\mathsf{RCA}^\omega_0\) the equivalence of formulations of the Heine-Borel theorem and bounding principles for semi-continuous functions. Adding the choice principle \(\mathsf{QF}\text{-}\mathsf{AC}^{0,1}\) to the base system, they extend the equivalences to include supremum principles for semi-continuous functions. A new choice principle, \(\mathsf{CIC}\) for choosing elements from sequences of nonempty closed subsets of \([0,1]\) is introduced, and plays a prominent role in the analysis of sequential forms of results for semi-continuous functions. A sequential form of the Heine-Borel theorem is shown to be equivalent to comprehension statements in the \(\mathsf{WKL}_0\) range plus a choice principle \(\mathsf{OC}^{0,0}\) that is not provable from \(\mathsf{CIC}\). The article closes with a discussion of variations of the results involving \(\mathsf{WWKL}_0\), Cousin's lemma, and the Lebesgue number lemma. Semi-continuous functions were previously studied using second-order formalizations by \textit{D. Fernández-Duque} et al. [Sel. Math., New Ser. 26, No. 5, Paper No. 68, 37 p. (2020; Zbl 1467.03006)] and with \textit{David Fernández-Duque} et al. [``Metric fixed point theory and partial impredicativity, Preprint, \url{arXiv:2302.08874}].



Cites work









This page was built for publication: On sequential theorems in reverse mathematics

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6857832)