The strength of compactness in computability theory and nonstandard analysis (Q2326415)

The authors work in higher-order reverse mathematics to determine the strength of compactness theorems for uncountable covers, related fan functionals, and principles of formal nonstandard analysis. Some of these principles have strong set comprehension consequences in comparison to the traditional subsystems of reverse mathematics. This work is part of a series of papers by the authors, including [J. Math. Log. 19, No. 1, Article ID 1950001, 40 p. (2019; Zbl 1484.03018); J. Symb. Log. 84, No. 4, 1422--1465 (2019; Zbl 1454.03018)], and two additional papers available as preprints [``Representations in measure theory: between a non-computable rock and a hard to prove place'', Preprint, \url{arXiv:1902.02756}; ``Pincherle's theorem in reverse mathematics and computability theory'', Ann. Pure Appl. Logic (to appear), \url{doi:10.1016/j.apal.2020.102788}].