Switch to: References

Add citations

You must login to add citations.
  1. Additivity properties of topological diagonalizations.Tomek Bartoszynski, Saharon Shelah & Boaz Tsaban - 2003 - Journal of Symbolic Logic 68 (4):1254-1260.
    We answer a question of Just, Miller, Scheepers and Szeptycki whether certain diagonalization properties for sequences of open covers are provably closed under taking finite or countable unions.
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • -Ultrafilters in the Rational Perfect Set Model.Jonathan Cancino-manríquez - 2024 - Journal of Symbolic Logic 89 (1):175-194.
    We give a new characterization of the cardinal invariant $\mathfrak {d}$ as the minimal cardinality of a family $\mathcal {D}$ of tall summable ideals such that an ultrafilter is rapid if and only if it has non-empty intersection with all the ideals in the family $\mathcal {D}$. On the other hand, we prove that in the Miller model, given any family $\mathcal {D}$ of analytic tall p-ideals such that $\vert \mathcal {D}\vert <\mathfrak {d}$, there is an ultrafilter $\mathcal {U}$ which (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Finding generic filters by playing games.Heike Mildenberger - 2010 - Archive for Mathematical Logic 49 (1):91-118.
    We give some restrictions for the search for a model of the club principle with no Souslin trees. We show that ${\diamondsuit(2^\omega, [\omega]^\omega}$ , is almost constant on) together with CH and “all Aronszajn trees are special” is consistent relative to ZFC. This implies the analogous result for a double weakening of the club principle.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • The Filter dichotomy and medial limits.Paul B. Larson - 2009 - Journal of Mathematical Logic 9 (2):159-165.
    The Filter Dichotomy says that every uniform nonmeager filter on the integers is mapped by a finite-to-one function to an ultrafilter. The consistency of this principle was proved by Blass and Laflamme. A medial limit is a universally measurable function from [Formula: see text] to the unit interval [0, 1] which is finitely additive for disjoint sets, and maps singletons to 0 and ω to 1. Christensen and Mokobodzki independently showed that the Continuum Hypothesis implies the existence of medial limits. (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • 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  
  • Towers in filters, cardinal invariants, and luzin type families.Jörg Brendle, Barnabás Farkas & Jonathan Verner - 2018 - Journal of Symbolic Logic 83 (3):1013-1062.
    We investigate which filters onωcan contain towers, that is, a modulo finite descending sequence without any pseudointersection. We prove the following results:Many classical examples of nice tall filters contain no towers.It is consistent that tall analytic P-filters contain towers of arbitrary regular height.It is consistent that all towers generate nonmeager filters, in particular Borel filters do not contain towers.The statement “Every ultrafilter contains towers.” is independent of ZFC.Furthermore, we study many possible logical implications between the existence of towers in filters, (...)
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • Set theory and c*-algebras.Nik Weaver - 2007 - Bulletin of Symbolic Logic 13 (1):1-20.
    We survey the use of extra-set-theoretic hypotheses, mainly the continuum hypothesis, in the C*-algebra literature. The Calkin algebra emerges as a basic object of interest.
    Download  
     
    Export citation  
     
    Bookmark  
  • M-separable spaces of functions are productive in the Miller model.Dušan Repovš & Lyubomyr Zdomskyy - 2020 - Annals of Pure and Applied Logic 171 (7):102806.
    Download  
     
    Export citation  
     
    Bookmark  
  • Many countable support iterations of proper forcings preserve Souslin trees.Heike Mildenberger & Saharon Shelah - 2014 - Annals of Pure and Applied Logic 165 (2):573-608.
    We show that many countable support iterations of proper forcings preserve Souslin trees. We establish sufficient conditions in terms of games and we draw connections to other preservation properties. We present a proof of preservation properties in countable support iterations in the so-called Case A that does not need a division into forcings that add reals and those who do not.
    Download  
     
    Export citation  
     
    Bookmark  
  • Exactly two and exactly three near-coherence classes.Heike Mildenberger - 2023 - Journal of Mathematical Logic 24 (1).
    We prove that for [Formula: see text] and [Formula: see text] there is a forcing extension with exactly n near-coherence classes of non-principal ultrafilters. We introduce localized versions of Matet forcing and we develop Ramsey spaces of names. The evaluation of some of the new forcings is based on a relative of Hindman’s theorem due to Blass 1987.
    Download  
     
    Export citation  
     
    Bookmark  
  • Sacks forcing, Laver forcing, and Martin's axiom.Haim Judah, Arnold W. Miller & Saharon Shelah - 1992 - Archive for Mathematical Logic 31 (3):145-161.
    In this paper we study the question assuming MA+⌝CH does Sacks forcing or Laver forcing collapse cardinals? We show that this question is equivalent to the question of what is the additivity of Marczewski's ideals 0. We give a proof that it is consistent that Sacks forcing collapses cardinals. On the other hand we show that Laver forcing does not collapse cardinals.
    Download  
     
    Export citation  
     
    Bookmark   18 citations  
  • There May be Infinitely Many Near-Coherence Classes under u < ∂.Heike Mildenberger - 2007 - Journal of Symbolic Logic 72 (4):1228 - 1238.
    We show that in the models of u < ∂ from [14] there are infinitely many near-coherence classes of ultrafilters, thus answering Banakh's and Blass' Question 30 of [3] negatively. By an unpublished result of Canjar, there are at least two classes in these models.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Lebesgue Measure Zero Modulo Ideals on the Natural Numbers.Viera Gavalová & Diego A. Mejía - forthcoming - Journal of Symbolic Logic:1-31.
    We propose a reformulation of the ideal $\mathcal {N}$ of Lebesgue measure zero sets of reals modulo an ideal J on $\omega $, which we denote by $\mathcal {N}_J$. In the same way, we reformulate the ideal $\mathcal {E}$ generated by $F_\sigma $ measure zero sets of reals modulo J, which we denote by $\mathcal {N}^*_J$. We show that these are $\sigma $ -ideals and that $\mathcal {N}_J=\mathcal {N}$ iff J has the Baire property, which in turn is equivalent to (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • Groupwise density and related cardinals.Andreas Blass - 1990 - Archive for Mathematical Logic 30 (1):1-11.
    We prove several theorems about the cardinal $\mathfrak{g}$ associated with groupwise density. With respect to a natural ordering of families of nond-ecreasing maps fromω toω, all families of size $< \mathfrak{g}$ are below all unbounded families. With respect to a natural ordering of filters onω, all filters generated by $< \mathfrak{g}$ sets are below all non-feeble filters. If $\mathfrak{u}< \mathfrak{g}$ then $\mathfrak{b}< \mathfrak{u}$ and $\mathfrak{g} = \mathfrak{d} = \mathfrak{c}$ . (The definitions of these cardinals are recalled in the introduction.) Finally, (...)
    Download  
     
    Export citation  
     
    Bookmark   8 citations