Switch to: References

Add citations

You must login to add citations.
  1. Mathias–Prikry and Laver–Prikry type forcing.Michael Hrušák & Hiroaki Minami - 2014 - Annals of Pure and Applied Logic 165 (3):880-894.
    We study the Mathias–Prikry and Laver–Prikry forcings associated with filters on ω. We give a combinatorial characterization of Martinʼs number for these forcing notions and present a general scheme for analyzing preservation properties for them. In particular, we give a combinatorial characterization of those filters for which the Mathias–Prikry forcing does not add a dominating real.
    Download  
     
    Export citation  
     
    Bookmark   13 citations  
  • The Nikodym property and cardinal characteristics of the continuum.Damian Sobota - 2019 - Annals of Pure and Applied Logic 170 (1):1-35.
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • Projective wellorders and mad families with large continuum.Vera Fischer, Sy David Friedman & Lyubomyr Zdomskyy - 2011 - Annals of Pure and Applied Logic 162 (11):853-862.
    We show that is consistent with the existence of a -definable wellorder of the reals and a -definable ω-mad subfamily of [ω]ω.
    Download  
     
    Export citation  
     
    Bookmark   9 citations  
  • Ideals of independence.Vera Fischer & Diana Carolina Montoya - 2019 - Archive for Mathematical Logic 58 (5-6):767-785.
    We study two ideals which are naturally associated to independent families. The first of them, denoted \, is characterized by a diagonalization property which allows along a cofinal sequence of stages along a finite support iteration to adjoin a maximal independent family. The second ideal, denoted \\), originates in Shelah’s proof of \ in Shelah, 433–443, 1992). We show that for every independent family \, \\subseteq \mathcal {J}_\mathcal {A}\) and define a class of maximal independent families, to which we refer (...)
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • Creature forcing and five cardinal characteristics in Cichoń’s diagram.Arthur Fischer, Martin Goldstern, Jakob Kellner & Saharon Shelah - 2017 - Archive for Mathematical Logic 56 (7-8):1045-1103.
    We use a creature construction to show that consistently $$\begin{aligned} \mathfrak d=\aleph _1= {{\mathrm{cov}}}< {{\mathrm{non}}}< {{\mathrm{non}}}< {{\mathrm{cof}}} < 2^{\aleph _0}. \end{aligned}$$The same method shows the consistency of $$\begin{aligned} \mathfrak d=\aleph _1= {{\mathrm{cov}}}< {{\mathrm{non}}}< {{\mathrm{non}}}< {{\mathrm{cof}}} < 2^{\aleph _0}. \end{aligned}$$.
    Download  
     
    Export citation  
     
    Bookmark   8 citations  
  • Matrix iterations and Cichon’s diagram.Diego Alejandro Mejía - 2013 - Archive for Mathematical Logic 52 (3-4):261-278.
    Using matrix iterations of ccc posets, we prove the consistency with ZFC of some cases where the cardinals on the right hand side of Cichon’s diagram take two or three arbitrary values (two regular values, the third one with uncountable cofinality). Also, mixing this with the techniques in J Symb Log 56(3):795–810, 1991, we can prove that it is consistent with ZFC to assign, at the same time, several arbitrary regular values on the left hand side of Cichon’s diagram.
    Download  
     
    Export citation  
     
    Bookmark   10 citations  
  • Pseudo P-points and splitting number.Alan Dow & Saharon Shelah - 2019 - Archive for Mathematical Logic 58 (7-8):1005-1027.
    We construct a model in which the splitting number is large and every ultrafilter has a small subset with no pseudo-intersection.
    Download  
     
    Export citation  
     
    Bookmark  
  • Partition Forcing and Independent Families.Jorge A. Cruz-Chapital, Vera Fischer, Osvaldo Guzmán & Jaroslav Šupina - 2023 - Journal of Symbolic Logic 88 (4):1590-1612.
    We show that Miller partition forcing preserves selective independent families and P-points, which implies the consistency of $\mbox {cof}(\mathcal {N})=\mathfrak {a}=\mathfrak {u}=\mathfrak {i}<\mathfrak {a}_T=\omega _2$. In addition, we show that Shelah’s poset for destroying the maximality of a given maximal ideal preserves tight mad families and so we establish the consistency of $\mbox {cof}(\mathcal {N})=\mathfrak {a}=\mathfrak {i}=\omega _1<\mathfrak {u}=\mathfrak {a}_T=\omega _2$.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • On cardinal characteristics of Yorioka ideals.Miguel A. Cardona & Diego A. Mejía - 2019 - Mathematical Logic Quarterly 65 (2):170-199.
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • Filter-linkedness and its effect on preservation of cardinal characteristics.Jörg Brendle, Miguel A. Cardona & Diego A. Mejía - 2021 - Annals of Pure and Applied Logic 172 (1):102856.
    We introduce the property “F-linked” of subsets of posets for a given free filter F on the natural numbers, and define the properties “μ-F-linked” and “θ-F-Knaster” for posets in a natural way. We show that θ-F-Knaster posets preserve strong types of unbounded families and of maximal almost disjoint families. Concerning iterations of such posets, we develop a general technique to construct θ-Fr-Knaster posets (where Fr is the Frechet ideal) via matrix iterations of <θ-ultrafilter-linked posets (restricted to some level of the (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Strongly unfoldable, splitting and bounding.Ömer Faruk Bağ & Vera Fischer - 2023 - Mathematical Logic Quarterly 69 (1):7-14.
    Assuming, we show that generalized eventually narrow sequences on a strongly inaccessible cardinal κ are preserved under a one step iteration of the Hechler forcing for adding a dominating κ‐real. Moreover, we show that if κ is strongly unfoldable, and λ is a regular cardinal such that, then there is a set generic extension in which.
    Download  
     
    Export citation  
     
    Bookmark  
  • 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  
  • Special ultrafilters and cofinal subsets of $$({}^omega omega, <^*)$$.Peter Nyikos - 2020 - Archive for Mathematical Logic 59 (7-8):1009-1026.
    The interplay between ultrafilters and unbounded subsets of \ with the order \ of strict eventual domination is studied. Among the tools are special kinds of non-principal ultrafilters on \. These include simple P-points; that is, ultrafilters with a base that is well-ordered with respect to the reverse of the order \ of almost inclusion. It is shown that the cofinality of such a base must be either \, the least cardinality of \-unbounded set, or \, the least cardinality of (...)
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • Generalised pseudointersections.Jonathan Schilhan - 2019 - Mathematical Logic Quarterly 65 (4):479-489.
    This paper is a compilation of results originating in the author's master thesis. We give a useful characterization of the generalized bounding and dominating numbers, and. We show that when. And we prove a higher analogue of Bell's theorem stating that is equivalent to ‐centered).
    Download  
     
    Export citation  
     
    Bookmark   1 citation