The Gamified Katětov order is not linear (in fact, very much not so)

Recently, the authors introduced the Gamified Katětov order on filters over $\omega$. This was shown to be strictly coarser than the classical Katětov order, and in fact collapses all MAD families to a single equivalence class. In the opposite direction, the present paper shows that the Gamified Katětov order also embeds $\mathcal{P}(\omega )\mathrm{/}\mathrm{F}\mathrm{i}\mathrm{n}$, and thus contains an antichain of size continuum. The analysis brings into focus some interesting connections with Ramsey theory. As part of a broader programme investigating the interplay between combinatorial and computable complexity, we then apply our construction to produce a large new family of non-modest degrees in the extended Weihrauch hierarchy, which arise from associated effective subtoposes.