{'fraction_non_alphanumeric': 0.04832104832104832, 'fraction_numerical': 0.05405405405405406, 'mean_word_length': 4.875, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
General topology meets model theory, on 𝔭 and 𝔱

Cantor proved in 1874 [Cantor G (1874) J Reine Angew Math 77:258–262] that the continuum is uncountable, and Hilbert’s first problem asks whether it is the smallest uncountable cardinal. A program arose to study cardinal invariants of the continuum, which measure the size of the continuum in various ways. By Gödel [Gödel K (1939) Proc Natl Acad Sci USA 25(4):220–224] and Cohen [Cohen P (1963) Proc Natl Acad Sci USA 50(6):1143–1148], Hilbert’s first problem is independent of ZFC (Zermelo-Fraenkel set theory with the axiom of choice). Much work both before and since has been done on inequalities between these cardinal invariants, but some basic questions have remained open despite Cohen’s introduction of forcing. The oldest and perhaps most famous of these is whether “,” which was proved in a special case by Rothberger [Rothberger F (1948) Fund Math 35:29–46], building on Hausdorff [Hausdorff (1936) Fund Math 26:241–255]. In this paper we explain how our work on the structure of Keisler’s order, a large-scale classification problem in model theory, led to the solution of this problem in ZFC as well as of an a priori unrelated open question in model theory.