2000 character limit reached
    
  Cichoń's maximum with evasion number (2401.14600v2)
    Published 26 Jan 2024 in math.LO
  
  Abstract: We show that the evasion number $\mathfrak{e}$ can be added to Cicho\'n's maximum with a distinct value. More specifically, it is consistent that $\aleph_1<\mathrm{add}(\mathcal{N})<\mathrm{cov}(\mathcal{N})<\mathfrak{b}<\mathfrak{e}<\mathrm{non}(\mathcal{M})<\mathrm{cov}(\mathcal{M})<\mathfrak{d}<\mathrm{non}(\mathcal{N})<\mathrm{cof}(\mathcal{N})<2{\aleph_0}$ holds.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.