Switch to: Citations

Add references

You must login to add references.
  1. (1 other version)Regular subalgebras of complete Boolean algebras.Aleksander Błaszczyk & Saharon Shelah - 2001 - Journal of Symbolic Logic 66 (2):792-800.
    It is proved that the following conditions are equivalent: (a) there exists a complete, atomless, σ-centered Boolean algebra, which does not contain any regular, atomless, countable subalgebra, (b) there exists a nowhere dense ultrafilter on ω. Therefore, the existence of such algebras is undecidable in ZFC. In "forcing language" condition (a) says that there exists a non-trivial σ-centered forcing not adding Cohen reals.
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • Mob families and mad families.Jörg Brendle - 1998 - Archive for Mathematical Logic 37 (3):183-197.
    We show the consistency of ${\frak o} <{\frak d}$ where ${\frak o}$ is the size of the smallest off-branch family, and ${\frak d}$ is as usual the dominating number. We also prove the consistency of ${\frak b} < {\frak a}$ with large continuum. Here, ${\frak b}$ is the unbounding number, and ${\frak a}$ is the almost disjointness number.
    Download  
     
    Export citation  
     
    Bookmark   16 citations  
  • Countable Fréchet Boolean groups: An independence result.Jörg Brendle & Michael Hrušák - 2009 - Journal of Symbolic Logic 74 (3):1061-1068.
    It is relatively consistent with ZFC that every countable $FU_{fin} $ space of weight N₁ is metrizable. This provides a partial answer to a question of G. Gruenhage and P. Szeptycki [GS1].
    Download  
     
    Export citation  
     
    Bookmark   11 citations  
  • Van Douwen’s diagram for dense sets of rationals.Jörg Brendle - 2006 - Annals of Pure and Applied Logic 143 (1-3):54-69.
    We investigate cardinal invariants related to the structure of dense sets of rationals modulo the nowhere dense sets. We prove that , thus dualizing the already known [B. Balcar, F. Hernández-Hernández, M. Hrušák, Combinatorics of dense subsets of the rationals, Fund. Math. 183 59–80, Theorem 3.6]. We also show the consistency of each of and . Our results answer four questions of Balcar, Hernández and Hrušák [B. Balcar, F. Hernández-Hernández, M. Hrušák, Combinatorics of dense subsets of the rationals, Fund. Math. (...)
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • Mad families, splitting families and large continuum.Jörg Brendle & Vera Fischer - 2011 - Journal of Symbolic Logic 76 (1):198 - 208.
    Let κ < λ be regular uncountable cardinals. Using a finite support iteration (in fact a matrix iteration) of ccc posets we obtain the consistency of b = a = κ < s = λ. If μ is a measurable cardinal and μ < κ < λ, then using similar techniques we obtain the consistency of b = κ < a = s = λ.
    Download  
     
    Export citation  
     
    Bookmark   14 citations  
  • Adjoining dominating functions.James E. Baumgartner & Peter Dordal - 1985 - Journal of Symbolic Logic 50 (1):94-101.
    If dominating functions in ω ω are adjoined repeatedly over a model of GCH via a finite-support c.c.c. iteration, then in the resulting generic extension there are no long towers, every well-ordered unbounded family of increasing functions is a scale, and the splitting number s (and hence the distributivity number h) remains at ω 1.
    Download  
     
    Export citation  
     
    Bookmark   21 citations