Switch to: References

Add citations

You must login to add citations.
  1. Construction with opposition: cardinal invariants and games.Jörg Brendle, Michael Hrušák & Víctor Torres-Pérez - 2019 - Archive for Mathematical Logic 58 (7-8):943-963.
    We consider several game versions of the cardinal invariants \, \ and \. We show that the standard proof that parametrized diamond principles prove that the cardinal invariants are small actually shows that their game counterparts are small. On the other hand we show that \ and \ are both relatively consistent with ZFC, where \ and \ are the principal game versions of \ and \, respectively. The corresponding question for \ remains open.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Indestructibility of ideals and MAD families.David Chodounský & Osvaldo Guzmán - 2021 - Annals of Pure and Applied Logic 172 (5):102905.
    In this survey paper we collect several known results on destroying tall ideals on countable sets and maximal almost disjoint families with forcing. In most cases we provide streamlined proofs of the presented results. The paper contains results of many authors as well as a preview of results of a forthcoming paper of Brendle, Guzmán, Hrušák, and Raghavan.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Mathias–Prikry and Laver type forcing; summable ideals, coideals, and +-selective filters.David Chodounský, Osvaldo Guzmán González & Michael Hrušák - 2016 - Archive for Mathematical Logic 55 (3-4):493-504.
    We study the Mathias–Prikry and the Laver type forcings associated with filters and coideals. We isolate a crucial combinatorial property of Mathias reals, and prove that Mathias–Prikry forcings with summable ideals are all mutually bi-embeddable. We show that Mathias forcing associated with the complement of an analytic ideal always adds a dominating real. We also characterize filters for which the associated Mathias–Prikry forcing does not add eventually different reals, and show that they are countably generated provided they are Borel. We (...)
    Download  
     
    Export citation  
     
    Bookmark   7 citations  
  • Template iterations with non-definable ccc forcing notions.Diego A. Mejía - 2015 - Annals of Pure and Applied Logic 166 (11):1071-1109.
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • Katětov Order on Mad Families.Osvaldo Guzmán - 2024 - Journal of Symbolic Logic 89 (2):794-828.
    We continue with the study of the Katětov order on MAD families. We prove that Katětov maximal MAD families exist under $\mathfrak {b=c}$ and that there are no Katětov-top MAD families assuming $\mathfrak {s\leq b}.$ This improves previously known results from the literature. We also answer a problem form Arciga, Hrušák, and Martínez regarding Katětov maximal MAD families.
    Download  
     
    Export citation  
     
    Bookmark